EMGT 501

HW #1
3.1-4
3.1-11
3.4-16
Due Day: Sep 14

3.1-4

Use the graphical method to solve the problem:

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

3.1-11 The Omega Manufacturing Manufacturing Company has

discontinued the production of a certain unprofitable product line.
This act created considerable excess production capacity.
Management is considering devoting this excess capacity to one
ore more of three products; call them products 1, 2, and 3. The
available capacity on the machines that might limit output is
summarized in the following table:

Machine Type
Milling machine
Lathe
Grinder

Available Time
(Machine Hours per Week)
500
350
150

The number of machine hours required for each unit of the

respective products is
Productivity coefficient (in machine hours per unit)
Machine Type
Product 1
Product 2 Product 3
Milling machine

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

x 2 number of units of product 2

x 3 number of units of product 3
Maximize Z 50 x1 20 x 2 25x 3 ,
subject to 9 x1 3x 2 5x 3 500
5x1 4 x 2
350
3x1

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

3.4-16 A cargo plane has three compartments for storing cargo:

front, center, and back. These compartments have capacity limits
on both weight and space, as summarized below:
Weight
Capacity
(Tons)
12

Space
Capacity
(Cubic Feet)
7,000

Center

18

9,000

Back

10

5,000

Compartment
Front

Further more, the weight of the cargo in the respective compartment

must be the same proportion of that compartments weight capacity
to maintain the balance of the airplane.

The following four cargoes have been offered for shipment on an

upcoming flight as space is available:
Cargo
1

Weight
(Tons)
20

Volume
(Cubic Feet/Ton)
500

Profit
($/Ton)
320

16

700

400

25

600

360

13

400

290

Any portion of these cargoes can be accepted. The objective is to

determine how much (if any) of each cargo should be accepted
and how to distribute each among the compartments to maximize
the total profit for the flight.
(a) Formulate a linear programming model for this problem.
(b) Solve this model by the simplex method to find one of its
multiple optimal solutions.

3-4-16

x1F # of tons of cargo type 1 in F conpartment

x1C # of tons of cargo type 1 in C conpartment
x1B # of tons of cargo type 1 in B conpartment
x2 F # of tons of cargo type 2 in F conpartment
x2C # of tons of cargo type 2 in C conpartment
x2 B # of tons of cargo type 2 in B conpartment
x3 F # of tons of cargo type 3 in F conpartment
x3C # of tons of cargo type 3 in C conpartment
x3 B # of tons of cargo type 3 in B conpartment
x4 F # of tons of cargo type 4 in F conpartment
x4C # of tons of cargo type 4 in C conpartment
x4 B # of tons of cargo type 4 in B conpartment

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