Product mix problems
Describes examples that involve the application of mixed integer-linear programming (MILP) to maximize profits given an available set of resources.
Product mix problems are a typical application of mixed integer-linear programming (MILP).
A simple product mix model
Consider a company which specializes in producing two gases from stocks of resources. The company makes a different profit on each gas produced. It would like a production plan maximizing its profits given its available stocks of resources.
The examples are:
Two very simple product mix models:
the first is examples/opl/gas. This example is accessed using the default run configuration Default Configuration.
the second is examples/opl/volsay. This example is accessed using the default run configuration Basic Configuration.
The same gas problem with named data: examples/opl/gas/gasn.mod. This example is accessed using the run configuration Indices in arrays.
The same gas problem with only a model file (data initialized in model file): examples/opl/gas/gas1.mod. This example is accessed using the run configuration No external data.
See Linear programming: a production planning example in the Language User’s Manual.