HW1
HW1
HW #1
3.1-4
3.1-11
3.4-16
Due Day: Sep 14
3.1-4
Maximize
Z 2 x1 x 2 ,
subject to
x2 10
2 x1 5 x2 60
x1 x2 18
3 x1 x2 44
and
x1 0, x 2 0.
Z 2 x1 x2 ,
Max
x2 10 (1)
s.t.
2 x1 5 x2 60 (2)
3-1-4
x2
(2)
(1)
(4 )
10
8
6
4
2
(3
)
x1 x2 18 (3)
3 x1 x2 44 (4)
and
x1 0, x2 0.
(13,5)
Optimal Solution
with Z=31
6 8 10 12
x1
Machine Type
Milling machine
Lathe
Grinder
Available Time
(Machine Hours per Week)
500
350
150
Lathe
Grinder
3
0
2
The sales department indicates that the sales potential for products 1
and 2 exceeds the maximum production rate and that the sales
potential for product 3 is 20 units per week. The unit profit would
be $50, $20, and $25, respectively, on products 1, 2, and 3. The
objective is to determine how much of each product Omega should
produce to maximize profit.
(a) Formulate a linear programming model for this problem.
(b) Use a computer to solve this model by the simplex method.
3-1-11
(a) Let
x1 number of units of product 1
2 x 3 150
x 3 20
x1 0, x 2 0, x 3 0.
(b)
x1* 26.1965
x2 * 54.7619
x3 * 20
Z * 2904.7619
Space
Capacity
(Cubic Feet)
7,000
Center
18
9,000
Back
10
5,000
Compartment
Front
Weight
(Tons)
20
Volume
(Cubic Feet/Ton)
500
Profit
($/Ton)
320
16
700
400
25
600
360
13
400
290
3-4-16
Max P 320 x1F 320 x1C 320 x1B 400 x2 F 400 x2C 400 x2 B
360 x3 F 360 x3C 360 x3 B 290 x4 F 290 x4C 290 x4 B
s.t.
x1F x2 F x3 F x4 F 12
x1C x2C x3C x4C 18
x1B x2 B x3 B x4 B 10
x1F x1C x1B 20
x2 F x2C x2 B 16
x3 F x3C x3 B 25
x4 F x4C x4 B 13
500 x1F 700 x2 F 600 x3 F 400 x4 F 7000
500 x1C 700 x2C 600 x3C 400 x4C 9000
500 x1B 700 x2 B 600 x3 B 400 x4 B 5000
1
1
1
1
1
1
1
1
x1F x2 F x3 F x4 F - x1C - x2C - x3C - x4C 0
12
12
12
12
18
18
18
18
1
1
1
1
1
1
1
1
x1F x2 F x3 F x4 F - x1B - x2 B - x3 B - x4 B 0
12
12
12
12
10
10
10
10
and
x1F 0, x1C 0, x1B 0, x2 F 0, x2C 0, x2 B 0,
x3 F 0, x3C 0, x3 B 0, x4 F 0, x4C 0, x4 B 0.
(b)
x1F * 0,
x1C * 5.5,
x1B * 10,
x 2F * 7.3333, x 2C * 4.167, x 2B * 0,
x 3F * 0,
x 3C * 0,
x 3B * 0,
x 4F * 4.66667, x 4C * 8.333, x 4B * 0.
Z* 13,330