论文信息 - Quadratic Programming for Least-Cost Feed Formulations under Probabilistic Protein Constraints

Quadratic Programming for Least-Cost Feed Formulations under Probabilistic Protein Constraints

This paper shows how a stochastic programming model for least-cost feed formulations under a probabilistic protein constraint and other linear restrictions can be solved by using an iterative quadratic programming technique. As the least-cost plan for a given probability level must be E-σ efficient, the result thus obtained is optimal.

Joyce T. Chen

[1] C. Panne,et al. Minimum-Cost Cattle Feed Under Probabilistic Protein Constraints , 1963 .

[2] A. Charnes,et al. Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints , 1963 .

[3] Leola Cutler,et al. A Computer Program for Quadratic Mathematical Models To Be Used for Aircraft Design and Other Applications Involving Linear Constraints , 1971 .

[4] Filmore E. Bender,et al. Linear Programming Approximation of Least-Cost Feed Mixes with Probability Restrictions , 1971 .

[5] S. Kataoka. A Stochastic Programming Model , 1963 .

[6] G. Zoutendijk,et al. Maximizing a Function in a Convex Region , 1959 .

[7] T. J. Cunha. Swine Feeding and Nutrition , 1957 .

[8] A. Charnes,et al. Chance-Constrained Programming , 1959 .