Blending or Mixing Models

One common type of problem solved by linear programming is to determine the optimal blend or mix of inputs to produce outputs with the right properties. These problems have a list of inputs and a list of outputs. The decision variables are:

\[ x_{ij} = \text{amount of input $i$ to blend/mix into output $j$} \]

There is a cost (profit) associated with blending/mixing the inputs into the outputs:

\[ c_{ij} = \text{unit cost of blending/mixing input $i$ into output $j$} \]

Finally, there are a number of restrictions on the inputs (e.g., supply of the input) and the outputs (e.g., the output must be composed of 50% of a given input), each of which becomes a constraint in the linear programme.

Blending/Mixing Case Studies

Results from OpsRes web retrieved at 11:34 (GMT)

Number of topics: 3

-- MichaelOSullivan - 20 Feb 2008

Edit | Attach | Watch | Print version | History: r5 < r4 < r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r5 - 2019-11-11 - MichaelOSullivan
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2021 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback