Problems 17-37

Unit column or unit vector A vector or column of a matrix that has a zero in every po
sition exceptone. In the nonzero position there is a 1. Thereis a unit column in the simplex
tableau for each basic variable.

Basis The set of variables that are not restricted to equal zero in the current basic solu
tion. The variables that make up the basis are termed basic variables, and the re'maining vari
ables are called nonbasic variables. .

Net evaluation row The row in the simplex tableau that contains the"Value of Cj —Zj for
every variable (cofumn).
Iteration The process of moving from one basic feasible solution to another.
Pivot elenient The element of the simplex tableau that is in both the pivot row and the
pivot column.
Pivot column The column in the simplex tableau corresponding to the nonbasic variable
that is about to be introduced into solution.

Pivot row The row in the simplex tableau corresponding to the basic variable that will
leave the solution.

Eleraentary row operations Operations that may be performed on a system of simulta

neous equations without changing the solution to,the system of equations.
Artificial variable A variable that has no physical meaning in terms of the original linear
programming problem, but serves merely to enable a basic feasible solution to be created
for starting the simplex method. Artificial variables are assigned an objective function co
efficient of —M, where M is a very large number.
Phase i When artificial variables are present in the initial simplex tableau, phase I refers
to the iterations of the simplex method that are required to eliminate the artificial vmables.
At the end of phase I, the basic feasible solution in the simplex tableau is also feasible for
the real problem.
Degeneracy When one or more of the basic variables has a value of zero.

R2.H 5 .6.a
PROBLEMS
V^/'^/1&. zo, 22.,
Consider the following system of linear equations;
•SELFh^SM
3x] + X2 =6
2x] + 4x2 + ^3 = 12

a. Find the basic solution withx, = 0.

b. Find the basic solution with x, = 0.
c. Find the basic solution with x-j = 0.
d. Which of the preceding solutions would be basic feasible solutions for a linear program? •
Consider the following linear program:
0
Max xi + 2x2
s.t.

X] + 5x2 — 10
2xi + 6x2 ^ 16
XpX, > 0
w
17-38 Chapter 17 Linear Programming: Simplex Method

a. Write the problem in standard form.

b. How many variables will be set equal to zero in a basic solution for this problem?
c. Find all the basic solutions, and indicate which are also feasible.
d. Find the optimal solution by computing the value of each basic feasible solution.
3. Consider the following linear program:

Max 5j[:, + 9x^

s.t.

V2X^ + 1^2 ^ 8
lx^ + IXn 10
ViX^ + y-iX^ > 6

X\,X2 S 0

a. Write the problem in standard form.

b. How many variables will be set equal to zero in a basic solution for this problem?
Explain.
c. Find the basic solution that corresponds to j, and ^2 equal to zero.
d. Find the basic solution that corresponds to x^ and 53 equal to zero.
e. Are your solutions for parts (c) and (d) basic feasible solutions? Extreme-point solu
tions? Explain.
f. Use the graphical approach to identify the solutions found in parts (c) and (d). Do the
graphical results agree with your answer to part (e)? Explain.
Consider the following linear programming problem:
SELF
Max 60^1 + 90^2
s.t.

15x, + 45x2 - 90
5x, + 5X2 < 20
> 0

a. Write the problem in standard form.

b. Develop the portion of the simplex tableau involving the objective function coeffi
cients, the coefficients of the variables in the constraints, and the constants for the
right-hand sides.
A partially completed initial simplex tableau is given;
SELF

Basis Cb 5 9 0 0

^1 0 10 9 1 0 90

•^2 0 -5 3 0 1 15

•a. Complete the initial tableau.

». Which variable would be brought into solution at the first iteration?
c. Write the original linear program.
 Problems 17-39

6.J The following partial initial simplex tableau is given:

SELFrm
-•^2 «i- ;S3.
'Basis Cg, 5 20 25 0 0 0

2 1 0 1 0 0 40

0 2 1 0 1 0 30

3 0 -y2 0 0 1 15

^7

a. Complete the initial tableau.

b. Write the problem in tableau form.
c. What is the initial basis? Does this basis correspond to the origin? Explain.
d. What is the value of the objective function at this initial solution?
e. For the next iteration, which variable should enter the basis, and which variable should
leave the basis?
f. How many units of the entering variable will be in the next solution? Before making
this first iteration, what do you think will be the value of the objective function after
the first iteration?
g. Find the optimal solution using the simplex method.
7. Solve the following linear program using the graphical approach:

Max 4xi + 5^2

s.t.

2xi + 2x2 — 20
Sx] + 1x2 ^ 42
X,,X2S0

Put the linear program in tableau form, and solve using the simplex method. Show the
sequence of extremepoints generatedby the simplex method on yoiir graph.
Recall the problem for Par, Inc., introduced in Section 2.1. The mathematical model for
this problem is restated as follows:

Max 1OX] + 9^2

s.t.

Viox, + 1x2 - 630 Cutting and dyeing

V2X1 + VeX2 ^ 600 Sewing
Ix, + %X2 < 708 Finishing
Viox^ + V4X2 ^ 135 Inspection and packaging
X,,X2 ^ 0

where

Xi = number of standard bags produced

X2 — number of deluxe bags produced

Use the simplex method to determine how many bags of each model Par should
manufacture.
What is the profit Par can earn with these production quantities?
¥
17-40 Chapter 17 Linear Programming: Simplex Mefhod

c. How many hours of production time will be scheduled for each operation?
d. What is the slack time in each operation?
9. RMC, Inc., is a small firm that produces a variety of chemical products. In a particular
production process, three raw materials are blended (mixed together) to produce two
products: a fuel additive and a solventbase.Each ton of fuel additive is a mixture of % ton
of material 1 and % ton of material 3. A ton of solvent base is a mixture of V2 ton of
material 1, Vs ton of material 2, and %o ton of material 3. After deducting relevant costs,
the profit contribution is $40 for every ton of fuel additive produced and $30 for every ton
of solvent base produced.
RMC's production is constrained by a limited availability of the three raw materials.
For the current production period, RMC has available the following quantities of each raw
material:

Raw Material Amount Available for Production

Material 1 20 tons
Material 2 5 tons
Material 3 21 tons

Assuming that RMC is interested in maximizing the total profit contribution, the problem
formulation is shown here:

Max 40x, + 30^2

s.t.

+ ¥2X2 < 20 Material 1

VsXj ^ 5 Material 2
%x^ + VioXj ^ 21 Material 3
^.,X2>0

where

xi = tons of fuel additive produced

X2 = tons of solvent base produced

Solve the RMC problem using the simplex method. At each iteration, locate the basic
feasible solution found by the simplex method on the graph of the feasible region.
Solve the following linear program:

Max 5j:i + Sxj + 24x2

s.t.

15;r, + 4x2 + ^^x^ ^ 2800

]5;ci + Sx2 ^ 6000
X, + 8x3 < 1200
JT], X2, X3 > 0
"

Problems 17-41

11. Solve the following linear program using both the graphical and the simplex methods:

Max Ixx + 8^2

s.t.

.3x1 + 9x2 ^ 45
2x1 + 1x2 ^ 12
Xj, X2^ 0

Show graphically how the simplex rriethod moves from one basic feasible solution to an
other. Find the coordinates of all extreme points of the feasible region.
'iTl'. Suppose acompany manufactures three products from two raw materials. The amount of
raw material in each unit of each product is given.

Raw Material Product A Product s Product C

I 71b 61b 31b
,11 51b 41b 21b

If the company has available 100 pounds of material I and 200 pounds of material II, and
if the profits for the three products are $20, $20, and $15, respectively, how much of each
product should be produced to maximize profits?
13. Liva's Lumber, Inc., manufactures three types of plywood. The following table summa
rizes the production hours per unit in each of three production operations and other data
for the problem.

Operatious (hours)
Plywood I II III Profit/Unit
Grade A 2 2 4 $40
Grade B 5 5 2 $30
Grade X 10 3 2 $20
Maximum time available 900 400 600

How many units of each grade of lumber should be produced?

A4.J Ye Olde Cording Winery in Peoria, Illinois, makes three kinds of authentic German wine:
Heidelberg Sweet, Heidelberg Regular, and Deutschland Extra Dry. The raw materials,
labor, and profit for a gallon of each of these wines are summarized here;

Grade A Grade B
Grapes Grapes Sugar Labor Profit/
Wine (bushels) (buslieis) (pounds) (hours) Gallon
Heidelberg Sweet 1 1 2 2 $ 1.00
Heidelberg Regular 2 0 1 3 $1.20
Deutschland Extra Dry 0 2 0 1 $2.00
17-42 Chapfer 17 Linear Programming: Simplex Method

If the winery has 150 bushels of grade A grapes, 150 bushels of grade B grapes, 80 pounds
of sugar, and 225 labor-hours available during the next week, what product mix of wines
will maximize the company's profit?
a. Solve using the simplex method.
b. Interpret all slack variables.
c. An increase in which resources could improve the company's profit?
Set up the tableau form for the following linear program (do not attempt to solve):
SELF
Max 4xi + 2x2 ~ ^^3 + 5^:4
s.t.

2xi — 1X2 + 1^3 + 2^4 s 50

3xi - 1x3 + 2^4 ^ 80
Ixi + 1x2 + 1^4 = 60
Xu X2, ^3, X4 > 0

(l^ Set up the tableau form for the following linear program (do not attempt to solve):
Min 4x] + 5^2 + 3^3
s.t.

4x] + 2x3 ^ 20
1X2 " 1^3 —
Ix] — 2x2
2X] + 1X2 + 1^3 - 12
^1,^2,^3 - 0

Solve the following linear program:

SELF
Min 3xi + 4x2 + 8x3
s.t.

4xi + 2x2 ^ 12
4X2 + 8x3 > 16
X], X2, X3 > 0

1^ Solve the following linear program:

Min 84xi + 4x2 + 30x3

s.t.

8x, + 1x2 + 3x3 < 240

16xi + 1x2 + 7x3 s 480
8x1 — 1X2 + 4X3 — 160
X], X2, X3 s 0

U) Captain John's Yachts, Inc., located in Fort Lauderdale, Florida, rents three types of ocean
going boats: sailboats, cabin cruisers, and Captain John's favorite, the luxury yachts. Captain
John advertises his boats with his famous "you rent—we pilot" slogan, which means that the
company supplies the captain and crew for each rented boat. Each rented boat has one captain,
of course, but the crew sizes (deck hands, galley hands, etc.) differ. The crew requirements, in
addition to a captain, are one for sailboats, two for cabin cruisers, and three for yachts. Ten em
ployees are captains, and an additional 18 employees fill the various crew positions. Cun^ently,
w
Problems 17-43

Captain John has rental requests for all of his boats: four sailboats, eight cabin cruisers, and
threeluxuryyachts.If Captain John's dailyprofitcontribution is $50 for sailboats, $70forcruis
ers, and $100 for luxury yachts, how many boats of each type should he rent?
The Our-Bags-Don't-Break (OBDB) plastic bag company manufactures threeplasticrefuse
bags for home use: a 20-gallon garbage bag, a 30-gallon garbage bag, and a 33-gallon leaf-
and-grass bag. Using purchased plastic material, three operations are required to produce
each end product: cutting, sealing, and packaging. The production time required to process
each type of bag in every operation and the maximum production time available for each
operation are shown (note that the production time figures in this table are per box of each
type of bag).

Production Time (seconds/box)

Type of Bag Cutting Sealing Packaging
20 gallons 2 2 3
30 gallons 3 2 4
33 gallons 3 3 5

Time available 2 hours 3 hours 4 hours

If OBDB's profit contribution is $0.10 for each box of 20-gallon bags produced, $0.15 for
each box of 30-gallon bags, and $0.20 for each box of 33-gallon bags, what is the optimal
product mix? ^
21. Kirkman Brothers ice cream parlors sell three different flavors of Dairy Sweet ice milk:
chocolate, vanilla, and banana. Due to extremely hot weather and a high demand for its
products, Kirkman has run short of its supply of ingredients: milk, sugar, and cream. Hence,
Kirkman will not be able to fill all the orders received from its retail outlets, the ice cream
parlors. Due to these circumstances, Kirkman decided to make the most profitable amounts
of the three flavors, given the constraints on supply of the basic ingredients. The company
will then ration the ice milk to the retail outlets.
Kirkman collected the following data on profitability of the various flavors, availabil
ity of supplies, and amounts required for each flavor.

Usage/Gallon
Profit/ Milk Sugar Cream
Flavor Gallon (gallons) (pounds) (gallons)
Chocolate $1.00 0.45 0.50 0.10
Vanilla $0.90 0.50 0.40 0.15
Banana $0.95 0.40 0.40 0.20

Maximum available 200 150 60

Determine the optimal product mix for Kirkman Brothers. What additional resources could
be used profitably?
Uforia Corporation sells two brands of perfume: Incentive and Temptation No. I. Uforia
sells exclusively through department stores and employs a three-person sales staff to call
on its customers. The amount of time necessary for each sales representative to sell one
case of each product varies with experience and ability. Data on the average time for each
of Uforia's three sales representatives is presented here.
w
17-44 Chapter 17 Linear Programming: Simplex Method

Average Sales Time per:ease (miiuites)

Salesperson Incentive Temptation No. 1
John 10
Brenda 15 • 10
Red 12 6

Eachsalesrepresentativespends approximately 80 hours per month in the actualselling of

these two products. Casesof Incentive and Temptation No. 1sell at profitsof $30and $25,
respectively. How many cases of each perfume should each person sell during the next
month to maximize the firm's profits? {Hint: Let = number of cases of Incentive sold
by John,X2 = numberof cases of Temptation No. 1 soldby John,^, = numberof cases of
Incentive sold by Brenda, and so on.)
Note: In Problems 23-29, we provide examples of linear programs that result in one or
more of the following situations:
Optimal solution
Infeasible solution
Unbounded solution
Alternative optimal solutions
Degenerate solution
For each linear program, determine the solution situation that exists, and indicate how you
identified each situation using the simplex method. For the problems with alternative op
timal solutions, calculate at least two optimal solutions.

1 (23. Max 4xi + 8x2

SELF s.t.

1 2xi + 2x2 — 10
-Ui + 1x2^ 8
Xi,X2^0

Min 3j:i + 3x2

SELF s.t.

2xi + 0.5x2 ^ 10
2xi > 4
4xi + 4x2 ^ 32
X],X2 ^ 0

Min 1.^1 + \X2

SELF s.t.

8a'i + 6X2 S 24
4x, + 6X2 ^ -12
2X2 ^ 4
A], X2 S 0

Max 2Xi + 1X2+1X3

s.t.

4x| + 2x2 + 2x3 — 4

2xi + 4.V2 — 20
4x] + 8a'2 + 2a'3 ^ 16
X|. X2, X3 > 0
w
Problems 17-45

27. Max 2x^ + 4^2

s.t.

Ixi + ^2X2 ^ 10
Ix, + 1x2 = 12
IX] + %X2 - 18
Xi, X2^ 0

Min —4xi + 5x2 + ^^3

s.t.

1X2 + 1;C3 > 2

-IX] + 1X2 + 1^3 — 1
-1X2 ^ 1
Xi, X2, X3 > 0

29. Solve the following linear program and identify any alternative optimal solutions.

Max 120a:i + 80^2 + 14^:3

s.t.

4x, + 8;c2 + ^3 ^ 200

2x2 + 1x3 < 300
32x, + 4x2 + 2x3 = 400
^1,-^2,^3 - 0

30.1 Supersport Footballs, Inc., manufactures three kinds of footballs: an All-Pro model, a
College model, and a High School model. All three footballs require operations in the
following departments: cutting and dyeing, sewing, and inspection and packaging. The
production times and maximum production availabilities are shown here.

Production Time (minutes)

Cutting Inspection
Model and Dyeing Sewing and Packaging
All-Pro 12 15 3
College 10 15 4
High School 8 12 2

Time available 300 hours 200 hours 100 hours

Current orders indicate that at least 1000 All-Pro footballs must be manufactured.
a. If Supersport realizes a profit contribution of $3 for each All-Pro model, $5 for each
College model, and $4 for each High School model, how many footballs of each type
should be produced? What occurs in the solution oif this problem? Why?
b. If Supersport can increase sewing time to 300 hours and inspection and packaging time
to 150 hours by using overtime, what is your recommendation?