Difference: BlendingModels (1 vs. 5)

Revision 52019-11-11 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="LinearProgramming" 
<-- Ready for Review -->
Line: 23 to 23
  -- MichaelOSullivan - 20 Feb 2008
Changed:
<
<
META FILEATTACHMENT attachment="latex360917adf5f69523fdcf8a0e7465ec45.png" attr="h" comment="" date="1203543104" name="latex360917adf5f69523fdcf8a0e7465ec45.png" stream="GLOB(0x9f52004)" tmpFilename="latex360917adf5f69523fdcf8a0e7465ec45.png" user="MichaelOSullivan" version="1"
META FILEATTACHMENT attachment="latex9761e702620b74ef0843cad013d6d6fb.png" attr="h" comment="" date="1203543104" name="latex9761e702620b74ef0843cad013d6d6fb.png" stream="GLOB(0x9f51f50)" tmpFilename="latex9761e702620b74ef0843cad013d6d6fb.png" user="MichaelOSullivan" version="1"
>
>
META FILEATTACHMENT attachment="latex261939bff8a40f57f368382672f79839.png" attr="h" comment="" date="1573440814" name="latex261939bff8a40f57f368382672f79839.png" user="MichaelOSullivan" version="1"
META FILEATTACHMENT attachment="latex4f4713075c8f9dfafc3784a3ce924482.png" attr="h" comment="" date="1573440814" name="latex4f4713075c8f9dfafc3784a3ce924482.png" user="MichaelOSullivan" version="1"

Revision 42008-02-23 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="LinearProgramming"
Added:
>
>
<-- Ready for Review -->
 

Revision 32008-02-21 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="LinearProgramming"
Line: 15 to 15
  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.
Changed:
<
<		Blending/Mixing Case Studies
>
>

Blending/Mixing Case Studies

 

Results from OpsRes web retrieved at 15:46 (GMT)

HerdFeedingProblem
r16 - 2009-10-06 - 07:44 MichaelOSullivan 

<--/twikiTopRow-->
<--/twikiSummary-->
<--/twikiBottomRow-->
<--/patternSearchResult-->
WhiskasCatFoodProblem
r56 - 2019-07-20 - 05:53 TWikiAdminUser 

<--/twikiTopRow-->
<--/twikiSummary-->
<--/twikiBottomRow-->
<--/patternSearchResult-->
WinstoneAggregatesProblem
r3 - 2008-04-02 - 09:49 MichaelOSullivan 

<--/twikiTopRow-->
<--/twikiSummary-->
<--/twikiBottomRow-->
<--/patternSearchResult-->
Number of topics: 3
<--/patternSearchResultCount-->

Revision 22008-02-20 - MichaelOSullivan

Line: 1 to 1
 
META TOPICPARENT name="LinearProgramming"
Line: 15 to 15
  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.
Added:
>
>		Blending/Mixing Case Studies

Results from OpsRes web retrieved at 15:46 (GMT)

HerdFeedingProblem
r16 - 2009-10-06 - 07:44 MichaelOSullivan 

<--/twikiTopRow-->
<--/twikiSummary-->
<--/twikiBottomRow-->
<--/patternSearchResult-->
WhiskasCatFoodProblem
r56 - 2019-07-20 - 05:53 TWikiAdminUser 

<--/twikiTopRow-->
<--/twikiSummary-->
<--/twikiBottomRow-->
<--/patternSearchResult-->
WinstoneAggregatesProblem
r3 - 2008-04-02 - 09:49 MichaelOSullivan 

<--/twikiTopRow-->
<--/twikiSummary-->
<--/twikiBottomRow-->
<--/patternSearchResult-->
Number of topics: 3
<--/patternSearchResultCount-->
 -- MichaelOSullivan - 20 Feb 2008

META FILEATTACHMENT attachment="latex360917adf5f69523fdcf8a0e7465ec45.png" attr="h" comment="" date="1203543104" name="latex360917adf5f69523fdcf8a0e7465ec45.png" stream="GLOB(0x9f52004)" tmpFilename="latex360917adf5f69523fdcf8a0e7465ec45.png" user="MichaelOSullivan" version="1"

Revision 12008-02-20 - MichaelOSullivan

Line: 1 to 1
Added:
>
>
META TOPICPARENT name="LinearProgramming"

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.

-- MichaelOSullivan - 20 Feb 2008

META FILEATTACHMENT attachment="latex360917adf5f69523fdcf8a0e7465ec45.png" attr="h" comment="" date="1203543104" name="latex360917adf5f69523fdcf8a0e7465ec45.png" stream="GLOB(0x9f52004)" tmpFilename="latex360917adf5f69523fdcf8a0e7465ec45.png" user="MichaelOSullivan" version="1"
META FILEATTACHMENT attachment="latex9761e702620b74ef0843cad013d6d6fb.png" attr="h" comment="" date="1203543104" name="latex9761e702620b74ef0843cad013d6d6fb.png" stream="GLOB(0x9f51f50)" tmpFilename="latex9761e702620b74ef0843cad013d6d6fb.png" user="MichaelOSullivan" version="1"
View topic | History: r5 < r4 < r3 < r2 | More topic actions...
 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback