Example 1.1 Linear programming model in decision making. A given company
synthesizes two products Prod1 and Prod2 based on two kinds of raw materials M1
and M2. The objective consists in finding the most profitable product mix. Table 1.1
presents the daily available raw materials forM1 andM2, and for each product Prodi the
used amount of raw materials and the profit. The decision variables are x1 and x2 that
represent, respectively, the amounts of Prod1 and Prod2. The objective function consists
in maximizing the profit.
The model of this problem may be formulated as an LP mathematical program:
Max profit = 5x1 + 4x2
subject to the constraints
6x1 + 4x2 ≤ 24
1x1 + 2x2 ≤ 6
x1, x2 ≥ 0