MS 3033: Management Science and Production

Summer II 2002 Midterm Test Name: _______________________________ SSN: _______________________________

1.

Solve the following linear programming problem graphically. Label each of the constraints and shade the feasible region. Label each of the feasible extreme point with their coordinates. Draw at least one objective function line. Indicate the optimal solution on the graph. Find the values of x1 and x2 , and find the value of the objective function at the optimal solution. (20) min s.t. 7 x1 + 2 x2 4 x1 + 5 x2 = 20 2 x1 + 7 x2 14 6 x1 + 2 x2 18 x1 , x2 0

x2 10 9 8 7 6 5 4 3 2 1

10

11

x1

2.

Solve the following linear programming problem with the simplex method. (20) max s.t. 4 x1 + 5 x2 3 x1 + 2 x2 15 5 x1 + 8 x2 = 40 x1 , x2 0

3. a.

Choose your best choice for each of the following multiple choice questions. Given the following simplex tableau for a maximization LP problem, which of the following statements correctly describes the problem? (4)

cj

M A2
0 1 0

cB
5

B.V . x1 A2 s3 zj cj zj

x1
1 0 0 5

x2
1 5

x3
2 5

s1
3 5

s3
0 0 1

RHS
8 5

M
0

5 2

1 2
2 3

4
8 3

2 3

1 3 3 3

M 1 + 52

2+ M 2 2 M 2

M 0

0 0

8 4M

2 5M 2

(a) (b) (c) (d) (e)

there is no feasible solution the objective function is unbounded there are alternative optimal solutions the unique feasible optimal solution has been found although the current solution is infeasible, a feasible solution may be found

b.

Given the following simplex tableau for a maximization LP problem, which of the following statements correctly describes the problem? (4)

cj cB
4 7 0

B.V . x1 x3 s3 zj cj zj

x1
1 0 0 4 0

x2
3 4 2 7

x3
0 1 0 7 0

s1
1 2 1 7 5 2

s2
1 4 2 7 1 2 1 1

s3
0 0 1 0 0

RHS
5 2 4 7 9 2

1 2 1 1

3 3

14

(a) (b) (c) (d) (e)

there is no feasible solution the objective function is unbounded there are alternative optimal solutions the unique feasible optimal solution has been found although the current solution is not optimal, an optimal solution may be found

c.

If the second constraint in a maximization LP problems is x1 2 x2 + 5 x7 = 38, which of the following should be the standard form for this constraint? (4) (a) (b) (c) (d) (e) (f)

x1 2 x2 + 5 x7 s2 + A2 38 x1 2 x2 + 5 x7 + A2 = 38 x1 2 x2 + 5 x7 s2 = 38 x1 2 x2 + 5 x7 = 38 x1 2 x2 + 5 x7 + s2 + A2 = 38 none of the above

d.

Given the following simplex tableau for a maximization LP problem, which of the following statements correctly describes the problem? (4)

cj cB
6 2 0

B.V . x2 x1 s3 zj cj zj

x1
0 1 0 2 0

x2
1 0 0 6 0

x3
1 3
3 2 1 2

A1

2 3 1 2

s2
1 3 5 2 1 2

s3
0 0 1 0 0

RHS
4 3 11 2

5 2 3 M + 3

4 19

1 0

7 7

(a) (b) (c) (d) (e) e.

there is no feasible solution the objective function is unbounded there are alternative optimal solutions the unique feasible optimal solution has been found although the current solution is infeasible, a feasible solution may be found

After simplification, which of the following is an acceptable constraint in a linear programming model? (4) (a) (b) (c) 3.5 x1 + 0.5 x2 + 3x1 x3 17.3

x1 + 3 x2 + 3 x3 0.45 x1 2 x1 + 5 x2 + x3 + 2 x4 x1 + 3 x3 4 x1 + x2 + 2 x3 + 4 x4
3x1 + 2 x2 x3 4 x3 25 none of the above all of the above

(d) (e) (f)

4.

Marketing Associates is a marketing research firm that handles consumer surveys for several clients. One client is a national press service that periodically conducts political polls on issues of widespread interest. To draw statistically valid conclusions on the sensitive issue of new U.S. immigration laws in a survey for the press service, Marketing Associates determines that it must fulfill several requirements. 1. 2. 3. 4. 5. Survey at least 2,500 U.S. households in total. Ensure that at least 40% of households surveyed with heads who are 30 years of age or younger. Ensure that at least 20% of households surveyed with heads who are between 31 and 50 years of age. Ensure that at least 15% of those households surveyed live in a state that borders on Mexico. Ensure that no more than 20% of those surveyed who are 51 or over live in states that border Mexico.

Marketing Associates decides that all surveys should be conducted in person. It estimates that the cost of reaching people in each age and region category are as follows. Region States bordering Mexico States not bordering Mexico Age Between 31 and 50 $6.90 7.50

30 or younger $7.80 8.00

51 or older $5.60 6.80

You are required to formulate a linear programming model to determine the number of households in each category to minimize the cost of survey within the restrictions of the above requirements. a. Define the decision variables. (5)

b.

Formulate the objective function. (5)

c.

Formulate the constraints. (10)

5.

Sunco Oil Inc. produces gasoline at two refineries. Refinery 1 can produce up to 150,000 gallons and Refinery 2 can produce up to 200,000 gallons per week. Although it is possible to ship directly from the refineries to Suncos customers in Los Angels and San Francisco, Sunco ships gasoline from the refineries to the ports of Mobile and Gaveston and then ship it by tanker to Los Angels and San Francisco. It is possible to ship gasoline between Los Angels and San Francisco if necessary. Los Angels requires 160,000 gallons per week and San Francisco requires 150,000 gallons per week. The cost of shipping each 1000 gallons of gasoline between different locations are given in the following table.

To From Refinery 1 (1) Refinery 2 (2) Mobile (3) $10 15 Galveston (4) $13 12 From Mobile (3) Galveston (4) Los Angles (5) San Francisco (6) Los Angels (5) 16 14 4

To San Francisco (6) 17 16 4

You are required to formulate a linear programming model to determine the quantity of gasoline to ship along each road so as to minimize the total distribution cost. a. Draw a network to represent the distribution system. (5)

b.

Define the decision variables. (5)

c.

Formulate the objective function. (3)

d.

Formulate the constraints. (7)

6.

Steelco manufactures two types of steel at three different steel mills. Because of the differences in the furnaces at each mill, the time and cost to produce a ton of steel differs for each mill. The per ton furnace time needed and per ton production cost as well as the monthly furnace time available are shown in the following table. Each month, Steelco must manufacture at least 500 tons of Steel 1 and 600 tons of Steel 2.

Steel 1 Mill Cost Mill 1 Mill 2 Mill 3 $10 $12 $14 Time (Minutes) 20 24 28 Cost $13 $15 $11

Steel 2 Time (Minutes) 18 29 22

Furnace Time Available (Minutes) 8000 10000 9000

The following variables have been defined

x11 Steel 1 in tons manufactured at Mill 1 x21 Steel 1 in tons manufactured at Mill 2 x31 Steel 1 in tons manufactured at Mill 3

x12 Steel 2 in tons manufactured at Mill 1 x22 Steel 2 in tons manufactured at Mill 2 x32 Steel 2 in tons manufactured at Mill 2

The following linear programming model has been formulated to minimize the cost of manufacturing the desired steel. 10 x11 + 12 x21 + 14 x31 + 13x12 + 15 x22 + 11x32

min s.t.

x11 + x21 + x31

20 x11 24 x21 28 x31

x12 +18 x12

+ x22 +29 x22

+ x32

+22 x32

500 600 8000 10000 9000

x11 , x21 , x31 , x12 , x22 , x32 0

The following is the computer printout for this problem

LINEAR PROGRAMMING PROBLEM MIN 10X11+12X21+14X31+13X12+15X22+11X32 S.T. 1) 2) 3) 4) 5) 1X11+1X21+1X31>500 1X12+1X22+1X32>600 20X11+18X12<8000 34X21+29X22<10000 28X31+22X32<9000

OPTIMAL SOLUTION Objective Function Value = Variable -------------X11 X21 X31 X12 X22 X32 12525.455 Reduced Costs -----------------0.000 0.000 6.836 0.000 0.200 0.000

Value --------------228.182 271.818 0.000 190.909 0.000 409.091

Constraint -------------1 2 3 4 5

Slack/Surplus --------------0.000 0.000 0.000 758.182 0.000

Dual Prices ------------------12.000 -14.800 0.100 0.000 0.173

OBJECTIVE COEFFICIENT RANGES Variable -----------X11 X21 X31 X12 X22 X32 Lower Limit --------------9.778 10.000 7.164 9.200 14.800 No Lower Limit Current Value --------------10.000 12.000 14.000 13.000 15.000 11.000 Upper Limit --------------12.000 12.222 No Upper Limit 13.200 No Upper Limit 14.800

RIGHT HAND SIDE RANGES Constraint -----------1 2 3 4 5 Lower Limit --------------228.182 409.091 7554.011 9241.818 8454.902 Current Value --------------500.000 600.000 8000.000 10000.000 9000.000 Upper Limit --------------522.299 624.777 13436.364 No Upper Limit 13200.000

You are required to answer the following questions:

a.

The total monthly production cost is (2) (a) $8454.90 (b) $12525.46 (c) $13200.00 (d) $6981.82 (e) $5543.64

b.

The total monthly production cost for Steel 1 is (2) (a) $8454.90 (b) $12525.46 (c) $13200.00 (d) $6981.82 (e) $5543.64

c.

The total minimum monthly production cost for Steel 2 is (2) (a) $8454.90 (b) $12525.46 (c) $13200.00 (d) $6981.82 (e) $5543.64

d.

How much Steel 1 in tons is manufactured in Mill 2? (2) (a) 228.18 (b) 271.82 (c) 190.91 (d) 409.09 (e) 0.00

e.

How much Steel 2 in tons is manufactured in Mill 2? (2) (a) 228.18 (b) 271.82 (c) 190.91 (d) 409.09 (e) 0.00

f.

How much furnace time in minutes is used at Mill 1 to manufacture Steel 1? (2) (a) 600.00 (b) 8000.00 (c) 4563.64 (d) 4107.28 (e) unknown

g.

How much furnace time in minutes is used at Mill 1 to manufacture Steel 2? (2) (a) 3436.36 (b) 3818.18 (c) 4563.64 (d) 4107.28 (e) unknown

h.

How much total furnace time in minutes is used at Mill 3? (2) (a) 600.00 (b) 8000.00 (c) 10000.00 (d) 9000.00 (e) unknown

i.

Which mills have used the furnaces to their full capacities? (2) (a) (b) (c) (d) (e) (f) Mill 1 only Mill 2 only Mill 3 only Both Mill 2 and Mill 3 Both Mill 1 and Mill 2 Both Mill 1 and Mill 3

j.

How much idle time in minutes is left at Mill 2? (2) (a) 0.00 (b) 271.82 (c) 190.91 (d) 758.18 (e) unknown