Minimum-Cost Cattle Feed Under Probabilistic Protein Constraints

The optimal composition of cattle feed, which can be formulated as a linear programming problem in the case of certainty, is considered when compositions of inputs vary. In the corresponding linear programming formulation the coefficients of the constraints are not constant but can be considered as stochastic. Reformulating the constraints as chance constraints, a nonlinear programming problem results. For an illustrative example this problem is solved using one of Zoutendijk's methods of feasible directions.

• 저널Management Science · 9(3) · 405–430
• 토픽Optimization and Mathematical Programming · Control and Systems Engineering
• DOI10.1287/mnsc.9.3.405
• 저자C. van de Panne, Werner Popp