This article presents a method for solving linear programming problems in which elements of the tableau are stochastic. Using least‐cost poultry rations as an example, the authors demonstrate the procedure developed. Sufficiently accurate results are obtained with less time and complexity than required by alternative methods. The authors conclude that the largest obstacle to examining related problems is in the limitations imposed by lack of data, in this case with regard to biological minima.
No takes yet. Share an insight, caveat, or question.
Rahman et al. (1971) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: