9.5
THE SIMPLEX METHOD: MIXED CONSTRAINTS
In Sections 9.3 and 9.4, you looked at linear programming problems that occurred in
stan-
dard form.
The constraints for the maximization problems all involved
inequalities, and
the constraints for the minimization problems all involved
inequalities.
Linear programming problems for which the constraints involve
both
types of inequali-
ties are called
mixed-constraint
problems. For instance, consider the following linear
programming problem.
Mixed-Constraint Problem:
Find the maximum value of
Objective function
subject to the constraints
where
and
Because this is a maximization problem, you would
expect each of the inequalities in the set of constraints to involve
Moreover, because the
first inequality does involve
you can add a slack variable to form the following equation.
For the other two inequalities, a new type of variable, called a
surplus variable,
is intro-
duced as follows.
Notice that surplus variables are
subtracted from
(not added to) their inequalities. The vari-
ables
and
are called surplus variables because they represent the amount that the left
side of the inequality exceeds the right side. Surplus variables must be nonnegative.
Now, to solve the linear programming problem, form an initial simplex tableau as follows.
Basic
x
1
x
2
x
3
s
1
s
2
s
3
b
Variables
21
1
1
0 0
5
0
s
1
0
0
0
3
6
s
2
10
1
00
1
0
s
3
←
Departing
000
0
↑
Entering
You will soon discover that solving mixed-constraint problems can be difficult. One
reason for this is that there is no convenient feasible solution to begin the simplex method.
Note that the solution represented by the initial tableau above,
s
x
1
,
x
2
,
x
3
,
s
1
,
s
2
,
s
3
d
5
s
0, 0, 0, 50,
2
36,
2
10
d
,
2
2
2
1
2
1
2
1
2
1
s
3
s
2
x
1
1
x
3
2
s
3
5
10
2
x
1
1
x
2
2
s
2
5
36
2
x
1
1
x
2
1
x
3
1
s
1
5
50
≤
,
≤
.
x
3
≥
0.
x
2
≥
0,
x
1
≥
0,
x
1
1
x
3
≥
10
2
x
1
1
x
2
≥
36
2
x
1
1
x
2
1
x
3
≤
50
z
5
x
1
1
x
2
1
2
x
3
≥
≤
SECTION 9.5
THE SIMPLEX METHOD: MIXED CONSTRAINTS
557
Constraints