Directed Solution 4 2
Directed Solution 4 2
Directed Solution 4 2
The daily dietary requirements for the special food stipulate at least 30%
protein and at most 5% fiber. OZARK FARMS wants to determine the minimum
daily cost of the feed mix. Apply a PL model.
SOLUTION:
a) Definition of variables
X 1 : Quantity of pounds of corn to use in the daily mix.
X 2 : Quantity to use in pounds of soybean seed in the daily mixture.
c) Restrictions:
d) Non-negativity constraints:
X 1 0, X 2 0
Subject to
X 1 + X 2 ≥ 800
0.09X 1 + 0.60X 2 ≥ 0.30 (X 1 + X 2 )
0.02X 1 + 0.06X 2 0.05 (X 1 + X 2 )
X1,X20
2. XYZ Company produces screws and nails. The raw material for the screws costs
S/.2.00 per unit, while the material for each nail costs S/. 2.50. A nail requires two
hours of labor in department No. 1 and three hours in department No. 2, while a screw
requires 4 hours in department No. 1 and 2 hours in department No. 2, the hourly
wage in both departments is S/.2.00. If both products are sold at S/.18.00 and the
number of hours of labor available per week in the departments is 160 and 180
respectively, express the proposed problem as a linear program, such that profits are
maximized.
SOLUTION:
a) Definition of variables
COST = (hourly wage payment x total hours DPTO1 and DPTO2) + (Raw Material
Cost)
Max Z = 4X 1 + 5.50X 2
c) Restrictions
d) Non-negativity constraints
X10,X20
Max Z = 4X 1 + 5.50X 2
Subject to
4X 1 + 2X 2 160
2X 1 + 3X 2 180
X1,X20
SOLUTION:
a) Definition of Variables:
c) Restrictions :
1x 1 + 2x 2 + 2x 3 + 4x 4 ≤ 50
x1<8
x2 < 10
2 ≤ x 3 < 12
X 4 < 24
15x 1 + 6x 2 + 7x 3 + 4x 4 ≤ 90
d) No Negativity Restrictions:
x1 ≥ 0, x2 ≥ 0 , x3 ≥ 0, x4 ≥ 0
Subject to
1x 1 + 2x 2 + 2x 3 + 4x 4 ≤ 50
Operations Research – Lic. Monica Zavala 4
ADMINISTRATION CAREER
x1<8
x2 < 10
2 ≤ x 3 < 12
X 4 < 24
15x 1 + 6x 2 + 7x 3 + 4x 4 ≤ 90
x1 , x2, x3 , x4 ≥ 0
SOLUTION:
a) Definition of variables:
X 1 : Quantity to purchase of aircraft A.
X 2 : Quantity to purchase of aircraft B.
X 3 : Quantity to purchase of aircraft C.
c) Restrictions:
2 1
Aircraft maintenance capacity:1 x 1 +1 X 2 + X 3 40
3 3
d) Non-negativity constraints:
X 1 0, X 2 0, X 3 0
Subject to
X1,X2,X30
Formulate the problem in a way that maximizes the amount of profit the seller
expects.
SOLUTION:
a) Definition of variables:
Maz Z = 150 X 1 + 84 X 2 – 90 X 1 - 30 X 2
Maz Z = 60 X 1 + 54 X 2
c) Restrictions
Product A: 0.5 X 1 20
Product B: 0.6 X 2 78
48 ≤ X 2
d) Non-negativity constraints:
X 1 0, X 2 0
Maz Z = 60 X 1 + 54 X 2
Subject to
0.5 X 1 20
0.6 X 2 78
48 ≤ X 2
3 X 1 + X 2 160
X1,X20
SOLUTION:
a) Definition of variables
c) Restrictions:
Minimum thickness: X 1 + X 2 + X 3 ≥ 12
Maximum thickness: X 1 + X 2 + X 3 48
1 1
x 1 + x 2 + X 3 ≥ 54
3 6
d) Non-negativity constraints
X 1 0, X 2 0, X 3 0
Subject to
X 1 + X 2 + X 3 ≥ 12
X 1 + X 2 + X 3 48
1 1
x 1 + x 2 + X 3 54
3 6
X 1 0, X 2 0, X 3 0
SOLUTION:
a) Definition of variables
c) Restrictions:
By law: X2≥X1+X3
d) Non-negativity constraints:
X 1 0, X 2 0, X 3 0
Subject to
X 1 ≤ 30
X 2 50
X 3 20
X2≥X1+X3
X1,X2,X30