Sausage Blending Using Multiple Objective Linear Programming
AbstractSingle objective cost minimization linear programming models are used as computerized decision-aids in sausage manufacturing (hot dogs, bologna, salami, etc.). However, sausage blending is clearly a problem with multiple conflicting criteria (cost, color, fat, protein, moisture, etc.) Presented in this paper is a vector-maximum/filtering MOLP (multiple objective linear programming) methodology for use as an improved decision-making approach with single formula sausage blending problems.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoArticle provided by INFORMS in its journal Management Science.
Volume (Year): 30 (1984)
Issue (Month): 11 (November)
sausage manufacturing; linear programming; multiple objective programming; vector maximization;
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
- Wang, Hsiao-Lin, 1996. "A systematic approach to natural recreational resource management," Socio-Economic Planning Sciences, Elsevier, vol. 30(1), pages 39-49, March.
- Agrell, Per J., 1995. "A multicriteria framework for inventory control," International Journal of Production Economics, Elsevier, vol. 41(1-3), pages 59-70, October.
- Gass, Saul I. & Roy, Pallabi Guha, 2003. "The compromise hypersphere for multiobjective linear programming," European Journal of Operational Research, Elsevier, vol. 144(3), pages 459-479, February.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc).
If references are entirely missing, you can add them using this form.