Answers are grounded in this paper and cite their sources.
We describe a production allocation problem which was worked on at Frito-Lay and an integer programming model formulated for its solution. In connection with model formulation, we discuss estimation and collection of the required cost coefficients. Finally, we report on the use of two different linear programs, representing the same integer problem, which gave dramatically different running times to solve the integer programs. Some reasons for the improved running times are given.
No takes yet. Share an insight, caveat, or question.
Mairs et al. (1978) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: