Minimum-Cost Cattle Feed Under Probabilistic Protein Constraints

Published Online:https://doi.org/10.1287/mnsc.9.3.405

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.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.