Sausage Blending Using Multiple Objective Linear Programming
Management Science · 1984 · Volume 30 · Issue 11
Abstract
Single 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.
Keywords
sausage manufacturing, linear programming, multiple objective programming, vector maximization
Enable JavaScript for citation tools and additional paper interactions.