CHAPTER 2

LINEAR PROGRAMMING MODELS: GRAPHICAL AND

COMPUTER METHODS
Note: Permission to use the computer program GLP for all LP graphical solution screenshots in this
chapter granted by its author, Jeffrey H. Moore, Graduate School of Business, Stanford University.
Software copyrighted by Board of Trustees of the Leland Stanford Junior University. All rights reserved.
SOLUTIONS TO DISCUSSION QUESTIONS
2-1. The requirements for an LP problem are listed in Section 2.2. It is also assumed that conditions of
certainty exist; that is, coefficients in the objective function and constraints are known with certainty and
do not change during the period being studied. Another basic assumption that mathematically
sophisticated students should be made aware of is proportionality in the objective function and
constraints. For example, if one product uses 5 hours of a machine resource, then making 10 of that
product uses 50 hours of machine time.
LP also assumes additivity. This means that the total of all activities equals the sum of each
individual activity. For example, if the objective function is to maximize Profit = 6X1 + 4X2, and if X1 =
X2 = 1, the profit contributions of 6 and 4 must add up to produce a sum of 10.
2-2. If we consider the feasible region of an LP problem to be continuous (i.e., we accept non-integer
solutions as valid), there will be an infinite number of feasible combinations of decision variable values
(unless of course, only a single solution satisfies all the constraints). In most cases, only one of these
feasible solutions yields the optimal solution.
2-3. A problem can have alternative optimal solutions if the level profit or level cost line runs parallel to
one of the problems binding constraints (refer to Section 2.6 in the chapter).
2-4. A problem can be unbounded if one or more constraints are missing, such that the objective value
can be made infinitely larger or smaller without violating any constraints (refer to Section 2.6 in the
chapter).
2-5. This question involves the student using a little originality to develop his or her own LP constraints
that fit the three conditions of (1) unbounded solution, (2) infeasibility, and (3) redundant constraints.
These conditions are discussed in Section 2.6, but each students graphical displays should be different.
2-6. The managers statement indeed has merit if he/she understood the deterministic nature of LP input
data. LP assumes that data pertaining to demand, supply, materials, costs, and resources are known with
certainty and are constant during the time period being analyzed. If the firm operates in a very unstable
environment (for example, prices and availability of raw materials change daily, or even hourly), the LP
models results may be too sensitive and volatile to be trusted. The application of sensitivity analysis
might, however, be useful to determine whether LP would still be a good approximating tool in decision
making in this environment.
2-7. The objective function is not linear because it contains the product of X1 and X2, making it a seconddegree term. The first, second, and fourth constraints are okay as is. The third and fifth constraints are

nonlinear because they contain terms to the second degree and one-half degree, respectively.
2-8. The computer is valuable in (1) solving LP problems quickly and accurately; (2) solving large
problems that might take days or months by hand; (3) performing extensive sensitivity analysis
automatically; and (4) allowing a manager to try several ideas, models, or data sets.
2-9. Most managers probably have Excel (or another spreadsheet software) available in their companies,
and use it regularly as part of their regular activities. As such, they are likely to be familiar with its usage.
In addition, a lot of the data (such as parameter values) required for developing LP models is likely to be
available either in some Excel file or in a database file (such as Microsoft Access) from which it is easy to
import to Excel. For these reasons, a manager may find the ability to use Excel to set up and solve LP
problems very beneficial.
2-10. The three components are: target cell (objective function), changing cells (decision variables), and
constraints.
2-11. Slack is defined as the RHS minus the LHS value for a constraint. It may be interpreted as the
amount of unused resource described by the constraint. Surplus is defined as the LHS minus the RHS
value for a constraint. It may be interpreted as the amount of over satisfaction of the constraint.
2-12. An unbounded solution occurs when the objective of an LP problem can go to infinity (negative
infinity for a minimization problem) while satisfying all constraints. Solver indicates an unbounded
solution by the message The Set Cell values do not converge.

SOLUTIONS TO PROBLEMS
2-13.
Y
20
19
18
17
16
15
14
13
12
11
10
9
8
7
6
5
4
3
2
1
0

: 1 .0 0 X + 0 .0 0 Y = 7 .0 0

: 2 .0 0 X - 1 .0 0 Y = 3 .0 0
: 5 .0 0 X + 2 .0 0 Y = 4 0 .0 0
P a y o f f : 5 .0 0 X + 3 .0 0 Y = 4 5 .0 0

: 3 .0 0 X + 6 .0 0 Y = 4 8 .0 0

O
:
:
:
:

p t im a l D e c is io
5 .0 0 X + 2 .0 0 Y
3 .0 0 X + 6 .0 0 Y
1 .0 0 X + 0 .0 0 Y
2 .0 0 X - 1 .0 0 Y

10

11

12

n s ( X ,Y ) : ( 6 .0 0 , 5 .0 0 )
< = 4 0 .0 0
< = 4 8 .0 0
< = 7 .0 0
> = 3 .0 0

See file P2-13.XLS.

Solution
Obj coeff
Constraints:
Constraint 1
Constraint 2
Constraint 3
Constraint 4

X
6.00
5

Y
5.00
3

5
3
1
2

2
6
-1

45.00
40.00
40
48.00
48
6.00
7
7.00
3
LHS Sign RHS

13

14

15

16

17

18

19

2-14.
Y
75
72
69
66
63
60
57
54
51
48
45
42
39
36
33
30
27
24
21
18
15
12
9
6
3
0

: 0 .0 0 X + 1 .0 0 Y = 7 0 .0 0

: 8 .0 0 X + 2 .0 0 Y = 1 6 0 .0 0

: 3 .0 0 X + 2 .0 0 Y = 1 2 0 .0 0

P a y o f f : 1 .0 0 X + 2 .0 0 Y = 6 8 .5 7

: 1 .0 0 X + 3 .0 0 Y = 9 0 .0 0

12

16

20

24

28

32

36

40

44

48

52

56

60

64

O p t im a l D e c is io n s ( X ,Y ) : ( 2 5 .7 1 , 2 1 .4 3 )
: 1 .0 0 X + 3 .0 0 Y > = 9 0 .0 0
: 8 .0 0 X + 2 .0 0 Y > = 1 6 0 .0 0
: 0 .0 0 X + 1 .0 0 Y < = 7 0 .0 0
: 3 .0 0 X + 2 .0 0 Y > = 1 2 0 .0 0

See file P2-14.XLS.

Solution
Obj coeff
Constraints:
Constraint 1
Constraint 2
Constraint 3
Constraint 4

X
Y
25.71 21.43
1
2
1
8
3

3
2
2
1

68.57
90.00
90
248.57
160
120.00
120
21.43
70
LHS Sign RHS

68

72

76

80

84

88

Y
75
72
69
66
63
60

2-15.
57
54
51
48
45
42
39
36

P a y o f f : 4 .0 0 X + 7 .0 0 Y = 2 4 5 .6 5

: 2 .0 0 X + 0 .0 0 Y = 7 5 .0 0

33
30
27

: 0 .0 0 X + 2 .0 0 Y = 4 5 .0 0

24
21
18
15

: 3 .0 0 X + 7 .0 0 Y = 2 3 1 .0 0

12
9
6

: 1 0 .0 0 X + 2 .0 0 Y = 2 0 0 .0 0

3
0
0

O p t im a l D
: 3 .0 0 X +
: 1 0 .0 0 X +
: 0 .0 0 X +
: 2 .0 0 X +

12

16

20

24

28

32

36

40

44

48

52

56

e c is io n s ( X ,Y ) : ( 1 4 .6 6 , 2 6 .7 2 )
7 .0 0 Y > = 2 3 1 .0 0
2 .0 0 Y > = 2 0 0 .0 0
2 .0 0 Y > = 4 5 .0 0
0 .0 0 Y < = 7 5 .0 0

See file P2-15.XLS.

Solution
Obj coeff
Constraints:
Constraint 1
Constraint 2
Constraint 3
Constraint 4

X
Y
14.66 26.72
4
7
245.66
3
10
2

7
2
2

231.00
231
200.00
200
53.44
45
29.31
75
LHS Sign RHS

60

64

68

72

76

80

84

88

18
17
16
15
14

2-16.
13
12
11
10
9

: 3 .0 0 X - 1 .0 0 Y =

1 .0 0

8
7
6

P a y o f f : 1 .0 0 X +

1 .0 0 Y =

6 .0 0

: 7 .0 0 X +

1 .0 0 Y = 2 0 .0 0

4
3

: 3 .0 0 X +

6 .0 0 Y = 2 9 .0 0

2
1
0
0
O
:
:
:

p t im
3 .0 0
7 .0 0
3 .0 0

al D
X +
X +
X -

e c is io
6 .0 0 Y
1 .0 0 Y
1 .0 0 Y

n s ( X ,Y ) : ( 2 .3 3 , 3 .6 7 )
< = 2 9 .0 0
< = 2 0 .0 0
> = 1 .0 0

See file P2-16.XLS.

Solution
Obj coeff
Constraints:
Constraint 1
Constraint 2
Constraint 3

X
2.33
1

Y
3.67
1

3
7
3

6
1
-1

6.00
29.00
29

20.00
20
3.33
1
LHS Sign RHS

10

11

Y
15
14

2-17.1 3
12
11
P a y o f f : 7 .0 0 X + 4 .0 0 Y = 5 4 .9 4

10
9

: 9 .0 0 X + 8 .0 0 Y = 7 2 .0 0

8
7
6
5

: 9 .0 0 X - 1 5 .0 0 Y = 0 .0 0

4
: 3 .0 0 X + 9 .0 0 Y = 2 7 .0 0

3
2
1
0
0

O p t im a l D e c is io n s ( X ,Y ) : ( 7 .5 8 , 0 .4 7 )
: 9 .0 0 X + 8 .0 0 Y < = 7 2 .0 0
: 3 .0 0 X + 9 .0 0 Y > = 2 7 .0 0
: 9 .0 0 X - 1 5 .0 0 Y > = 0 .0 0

See file P2-17.XLS.

Solution
Obj coeff
Constraints:
Constraint 1
Constraint 2
Constraint 3

X
7.58
7

Y
0.47
4

9
3
9

8
9
-15

54.95
72.00
72
27.00
27
61.11
0
LHS Sign RHS

10

2-18.
Y
15

: 2 .0 0 X + 0 .0 0 Y = 1 3 .0 0

14
13
12
11
10
9
: 1 .0 0 X - 1 .0 0 Y = 0 .0 0

8
7
6
5

P a y o f f : 3 .0 0 X + 7 .0 0 Y = 4 4 .4 4

4
3
2

: 9 .0 0 X + 3 .0 0 Y = 3 6 .0 0

: 4 .0 0 X + 5 .0 0 Y = 4 0 .0 0

1
0
0

O p t im a l D e c is io n s ( X ,Y ) : ( 4 .4 4 , 4 .4 4 )
: 9 .0 0 X + 3 .0 0 Y > = 3 6 .0 0
: 4 .0 0 X + 5 .0 0 Y > = 4 0 .0 0
: 1 .0 0 X - 1 .0 0 Y < = 0 .0 0
: 2 .0 0 X + 0 .0 0 Y < = 1 3 .0 0

See file P2-18.XLS.

Solution
Obj coeff
Constraints:
Constraint 1
Constraint 2
Constraint 3
Constraint 3

X
4.44
3

Y
4.44
7

9
4
1
2

3
5
-1

44.44
53.33
36
40.00
40
0.00
0
8.89
13
LHS Sign RHS

10

2-19. See file P2-19.XLS.

(a) Formulation 2 has multiple optimal solutions
(b) Formulation
3 has an unbounded solution
Y
10
(c) Formulation 1 is infeasible
(d) Formulation
4 has a unique optimal solution
9
Formulation
1 (Infeasible)
8
7
: 2 .0 0 X +

0 .0 0 Y =

7 .0 0

: 0 .0 0 X +
: 2 .0 0 X +

1 .0 0 Y =

2 .0 0 Y =

7 .0 0

6 .0 0

2
: 4 .0 0 X +

5 .0 0 Y = 2 0 .0 0

1
P a y o f f : 3 .0 0 X +

7 .0 0 Y = 1 2 .0 0

0
0

:
:
:
:

Y
10

2
4
0
2

.0
.0
.0
.0

0
0
0
0

X
X
X
X

+
+
+
+

1
5
2
0

.0
.0
.0
.0

0
0
0
0

Y
Y
Y
Y

<
<
<
>

= 6 .0 0
= 2 0 .0 0
= 7 .0 0
= 7 .0 0

Formulation
2 (Multiple Optimal Solutions)
8
7

: 1 .0 0 X +

0 .0 0 Y =

4 .0 0

P a y o f f : 3 .0 0 X +

6 .0 0 Y = 3 0 .0 0

: 0 .0 0 X +

2 .0 0 Y =

9 .0 0

3
:

1 .0 0 X +

2 .0 0 Y = 1 0 .0 0

7 .0 0 X +

6 .0 0 Y = 4 2 .0 0

0
0
O
:
:
:
:

1
p
7
1
1
0

t im
.0 0
.0 0
.0 0
.0 0

a
X
X
X
X

l D
+
+
+
+

e c is io
6 .0 0 Y
2 .0 0 Y
0 .0 0 Y
2 .0 0 Y

n s ( X ,Y ) : ( 3 .0 0 , 3 .5 0 ) ( 1 .0 0 , 4 .5 0 )
< = 4 2 .0 0
< = 1 0 .0 0
< = 4 .0 0
< = 9 .0 0

2-19 (continued). See file P2-19.XLS.

Formulation 3 (Unbounded Solution)
Y
10
9
8
7
: 1 .0 0 X +

0 .0 0 Y =

9 .0 0

6
5
: 1 .0 0 X +

4
P a y o f f : 2 .0 0 X +

2 .0 0 Y = 1 2 .0 0

3 .0 0 Y = 1 0 .0 0

: 0 .0 0 X +

2 .0 0 Y =

5 .0 0

2
: 8 .0 0 X +

7 .0 0 Y = 5 6 .0 0

0
0

10

O p t im a l D e c is io n s ( X ,Y ) : ( 9 .0 0 , 2 7 .2 4 )
: 1 .0 0 X + 2 .0 0 Y > = 1 2 .0 0

Y
1 0:

8 .0 0 X +
: 0 .0 0 X +
: 1 .0 0 X +

7 .0 0 Y > = 5 6 .0 0
2 .0 0 Y > = 5 .0 0
0 .0 0 Y < = 9 .0 0

8
Formulation
4 (Unique Optimal Solution)

6
: 2 .0 0 X +

0 .0 0 Y =

2 .0 0

2 .0 0 X +

1 .0 0 Y =

6 .0 0

2
:
1

: 1 .0 0 X +

1 .0 0 Y =

3 .0 0 X +

7 .0 0 Y = 2 1 .0 0

2 .0 0
P a y o ff:

3 .0 0 X +

4 .0 0 Y = 1 4 .4 5

0
0
O
:
:
:
:

1
p
3
2
1
2

t im
.0 0
.0 0
.0 0
.0 0

a
X
X
X
X

l D
+
+
+
+

e c is io
7 .0 0 Y
1 .0 0 Y
1 .0 0 Y
0 .0 0 Y

n s ( X ,Y ) : ( 1 .9 1 , 2 .1 8 )
< = 2 1 .0 0
< = 6 .0 0
> = 2 .0 0
> = 2 .0 0

2-20.
See file P2-20.XLS.
Solution
Obj coeff
Constraints:
Constraint 1
Constraint 2
Constraint 3
Constraint 4

A
B
C
40.00 30.00 30.00
28
41
38
10
0.4
1

15
0.4
1

-8
0.4

3,490.00
610.00
610.00
40.00
40.00
40.00
90.00
30.00
30.00
LHS Sign RHS

2-21. Let X = number of large sheds to build, Y = number of small sheds to build.
Objective: Maximize revenue = $50X + $20Y
Subject to:

X
+Y
150X + 50Y
X
X, Y

100
8,000
40
0

Advertising. Budget
Sq feet required
Rental limit
Non-negativity

Y
180
171
162
1
1
1
1
1
1
9
9

5
4
3
2
1
0
9
0

3
4
5
6
7
8

: 1 .0 0 X +

0 .0 0 Y = 4 0 .0 0

P a y o f f : 5 0 .0 0 X + 2 0 .0 0 Y = 2 9 0 0 .0 0

81
72
6
5
4
3
2
1
9
0

3
4
5
6
7
8

: 1 .0 0 X +

1 .0 0 Y = 1 0 0 .0 0

: 1 5 0 .0 0 X + 5 0 .0 0 Y = 8 0 0 0 .0 0
0

10

15

20

25

30

35

40

45

50

55

60

65

70

75

80

O p t im a l D e c is io n s ( X ,Y ) : ( 3 0 .0 0 , 7 0 .0 0 )
: 1 .0 0 X + 1 .0 0 Y < = 1 0 0 .0 0
: 1 5 0 .0 0 X + 5 0 .0 0 Y < = 8 0 0 0 .0 0
: 1 .0 0 X + 0 .0 0 Y < = 4 0 .0 0

See file P2-21.XLS.

Large Small
Number of sheds 30.00 70.00
Rent
$50
$20 $2,900.00
Constraints:
Advt. budget
$1
$1
$100.00 $100
Sq feet required
150
50
8,000.00 8,000
Rental limit
1
30.00
40
LHS Sign RHS

85

90

95

100

2-22. Let X = number of copies of Backyard, Y= number of copies of Porch.

Objective: Maximize revenue = $3.50X + $4.50Y
Subject to:

2.5X + 2Y
1.8X + 2Y
X,
Y
Y
12
11
10
10
96
90
84
78
72
66
60
54
48
42
36
30
24
18
12
60
0

00
40
80
20
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

2,160
1,800
0

: 1 .0 0 X +

: 1 .8 0 X +

Print time, minutes

Collate time, minutes
Non-negativity

0 .0 0 Y = 4 0 0 .0 0

2 .0 0 Y = 1 8 0 0 .0 0

: 0 .0 0 X +
P a y o f f : 3 .5 0 X +

: 2 .5 0 X +

0
O
:
:
:
:

50
p t im a l D
2 .5 0 X +
1 .8 0 X +
1 .0 0 X +
0 .0 0 X +

100
e c is io
2 .0 0 Y
2 .0 0 Y
0 .0 0 Y
1 .0 0 Y

150

200

250

300

350

400

450

500

550

600

650

700

750

800

850

900

See file P2-22.XLS.

Revenue
Constraints:
Print time, minutes
Collate time, minutes
Min Backyard to print
Min Porch to print

4 .5 0 Y = 3 8 3 0 .0 0

2 .0 0 Y = 2 1 6 0 .0 0

n s ( X ,Y ) : ( 4 0 0 .0 0 , 5 4 0 .0 0 )
< = 2 1 6 0 .0 0
< = 1 8 0 0 .0 0
> = 4 0 0 .0 0
> = 3 0 0 .0 0

Number of copies

1 .0 0 Y = 3 0 0 .0 0

Backyar
d
400.00

Porch
540.00

$3.50

$4.50

2.5
1.8
1

2.0
2.0
1

$3,830.
0
2,080.0 <=
1,800.0 <=
400.0 >=
540.0 >=
LHS
Sign

2,160
1,800
400
300
RHS

950

1000

2-23. Let X = number of small boxes, Y = number of large boxes.

Objective: Maximize revenue = $30X + $40Y
Subject to:
0.50X + 0.85Y
X
+Y
Y
X,
Y

Y
400
380
360

240
350
80
0

Square feet available

Min required, total
Min required, large
Non-negativity

340
320
300
280
260
240
220

P a y o f f : 3 0 .0 0 X + 4 0 .0 0 Y = 1 3 5 2 0 .0 0

200
180
160
140
120
100

: 0 .0 0 X + 1 .0 0 Y = 8 0 .0 0

80
60
40

: 1 .0 0 X + 1 .0 0 Y = 3 5 0 .0 0

: 0 .5 0 X + 0 .8 5 Y = 2 4 0 .0 0

20
0
0

25

50

75

100 125 150 175 200 225 250 275 300 325 350 375 400 425 450 475 500

O p t im a l D e c is io n s ( X ,Y ) : ( 3 4 4 .0 0 , 8 0 .0 0 )
: 0 .5 0 X + 0 .8 5 Y < = 2 4 0 .0 0
: 1 .0 0 X + 1 .0 0 Y > = 3 5 0 .0 0
: 0 .0 0 X + 1 .0 0 Y > = 8 0 .0 0

See file P2-23.XLS.

Number of boxes
Rent

Small
344.00
$30

Large
80.00
$40

$13,520.00

2-24. Let X = number of pounds of compost, Y = number of pounds of sewage in each bag.
Objective: Minimize cost = $0.05X + $0.04Y
Subject to:
X
2X
X

+Y
+Y
Y
Y

X,
Y
50
48
46
44
42
40
38
36
34
32
30
28
26
24
22
20
18
16
14
12
10
8
6
4
2
0

60
100
35
40
0

Pounds per bag

Fertilizer rating
Min compost, pounds
Max sewage, pounds
Non-negativity

P a y o f f : 0 .0 5 X + 0 .0 4 Y = 2 .8 0
: 0 .0 0 X + 1 .0 0 Y = 4 0 .0 0

: 2 .0 0 X + 1 .0 0 Y = 1 0 0 .0 0

: 1 .0 0 X + 1 .0 0 Y = 6 0 .0 0
: 1 .0 0 X + 0 .0 0 Y = 3 5 .0 0

12

15

18

21

24

27

30

33

36

39

42

45

O p t im a l D e c is io n s ( X ,Y ) : ( 4 0 .0 0 , 2 0 .0 0 )
: 1 .0 0 X + 1 .0 0 Y > = 6 0 .0 0
: 1 .0 0 X + 0 .0 0 Y > = 3 5 .0 0
: 0 .0 0 X + 1 .0 0 Y < = 4 0 .0 0
: 2 .0 0 X + 1 .0 0 Y > = 1 0 0 .0 0

See file P2-24.XLS.

Number of pounds
Cost

Compost Sewage
40.00
20.00
$0.05
$0.04 $2.80

48

51

54

57

60

2-25. Let X = thousand of dollars to invest in Treasury notes, Y = thousand of dollars to invest in
Municipal bonds.
Objective: Maximize return = 8X + 9Y
Subject to:

X +Y
X
2X + 3Y
X
X, Y

$250,000
0.7(X+Y)
2.42(X+Y)
0.3(X+Y)
0

Amount available
Max T-notes
Max risk score
Min T-notes
Non-negativity

Y
147
140
133
126
119
112
105
98
91
84
77
70
63
56
49
42
35
28
21
14
7
0

: - 0 .4 2 X + 0 .5 8 Y = 0 .0 0

: 0 .3 0 X - 0 .7 0 Y = 0 .0 0

: 0 .5 0 X - 0 .5 0 Y = 0 .0 0

P a y o f f : 8 .0 0 X + 9 .0 0 Y = 2 1 0 5 .0 0

: 1 .0 0 X + 1 .0 0 Y = 2 5 0 .0 0

15

30

45

60

75

90

105

120

135

150

165

180

195

210

225

O p t im a l D e c is io n s ( X ,Y ) : ( 1 4 5 .0 0 , 1 0 5 .0 0 )
: 1 .0 0 X + 1 .0 0 Y < = 2 5 0 .0 0
: 0 .5 0 X - 0 .5 0 Y > = 0 .0 0
: 0 .3 0 X - 0 .7 0 Y < = 0 .0 0
: - 0 .4 2 X + 0 .5 8 Y < = 0 .0 0

See file P2-25.XLS.

Amount invested
Return

T-notes M-bonds
$145,000 $105,000
8.00%
9.00% $21,050

240

255

270

285

300

2-26. Let X = number of TV spots, Y= number of newspaper ads placed.

Objective: Maximize exposure = 30,000X + 20,000Y
Subject to:

$3,200X + $1,300Y
X
Y
X
X,
Y
Y
100
95

$95,200
10
8X
5
0

Budget available
Max TV
Paper vs TV
Min TV
Non-negativity

: - 8 .0 0 X + 1 .0 0 Y = 0 .0 0

90
85
80
75
70
65
60
55
50
45
40
35
30
25

P a y o f f : 3 0 0 0 0 .0 0 X + 2 0 0 0 0 .0 0 Y = 1 3 3 0 0 0 0 .0 0

: 1 .0 0 X + 0 .0 0 Y = 1 0 .0 0

20
15
10

: 1 .0 0 X + 0 .0 0 Y = 5 .0 0

: 3 2 0 0 .0 0 X + 1 3 0 0 .0 0 Y = 9 5 2 0 0 .0 0

0
0

10

12

14

16

18

20

22

24

26

28

30

32

O p t im a l D e c is io n s ( X ,Y ) : ( 7 .0 0 , 5 6 .0 0 )
: 3 2 0 0 .0 0 X + 1 3 0 0 .0 0 Y < = 9 5 2 0 0 .0 0
: 1 .0 0 X + 0 .0 0 Y > = 5 .0 0
: 1 .0 0 X + 0 .0 0 Y < = 1 0 .0 0
: - 8 .0 0 X + 1 .0 0 Y < = 0 .0 0

See file P2-26.XLS.

Number used
Exposure

TV
Paper
7.00 56.00
30,000 20,000 1,330,000

34

36

38

40

42

44

46

48

50

2-27. Let X = number of air conditioners to produce, Y = number of fans to produce.

Objective: Maximize revenue = $25X + $15Y
Subject to:
3X
2X
1.5X
X,

+ 2Y
+Y
+ 0.5Y
Y

240
140
100
0

Wiring time
Drilling time
Assembly time
Non-negativity

Y
200
190
180
170
160
150

: 1 .5 0 X + 0 .5 0 Y = 1 0 0 .0 0

140
130
120
110
100
: 2 .0 0 X + 1 .0 0 Y = 1 3 9 .2 5

90
80
70
60

P a y o f f : 2 5 .0 0 X + 1 5 .0 0 Y = 1 8 9 6 .2 5

50
40

: 3 .0 0 X + 2 .0 0 Y = 2 4 0 .0 0

30
20
10
0
0

10

15

20

25

30

35

40

45

50

55

O p t im a l D e c is io n s ( X ,Y ) : ( 3 8 .5 0 , 6 2 .2 5 )
: 3 .0 0 X + 2 .0 0 Y < = 2 4 0 .0 0
: 2 .0 0 X + 1 .0 0 Y < = 1 3 9 .2 5
: 1 .5 0 X + 0 .5 0 Y < = 1 0 0 .0 0

See file P2-27.XLS.

Number of units
Profit

A/C Fan
40.00 60.00
$25 $15 $1,900.00

60

65

70

75

80

85

90

95

180
170
160
150
2-28.
X and Y are defined as in Problem 2-27. Objective remains the same.
140

Now subject to the following additional constraints:

130

120

110
100

30
50

Max fans
Min A/c

: 2 .0 0 X + 1 .0 0 Y = 1 4 0 .0 0
: 1 .0 0 X + 0 .0 0 Y = 5 0 .0 0

90

: 1 .5 0 X + 0 .5 0 Y = 1 0 0 .0 0
80
70
60

P a y o f f : 2 5 .0 0 X + 1 5 .0 0 Y = 1 8 2 5 .0 0

50
40
: 0 .0 0 X + 1 .0 0 Y = 3 0 .0 0
30

: 3 .0 0 X + 2 .0 0 Y = 2 4 0 .0 0

20
10
0
0
O
:
:
:
:
:

4
p t im a l D
3 .0 0 X +
2 .0 0 X +
1 .5 0 X +
1 .0 0 X +
0 .0 0 X +

8
e c is io
2 .0 0 Y
1 .0 0 Y
0 .5 0 Y
0 .0 0 Y
1 .0 0 Y

12

16

20

24

28

32

36

40

44

48

n s ( X ,Y ) : ( 5 5 .0 0 , 3 0 .0 0 )
< = 2 4 0 .0 0
< = 1 4 0 .0 0
< = 1 0 0 .0 0
> = 5 0 .0 0
< = 3 0 .0 0

See file P2-28.XLS.

A/C Fan
Number of units 55.00 30.00
Profit
$25 $15 $1,825.00

52

56

60

64

68

72

76

80

2-29. Let X = number of model A tubs to produce, Y= number of model B tubs to produce.
Objective: Maximize profit = $90X + $70Y
Subject to:
120X + 100Y
20X + 30Y
X
X,
Y

24,500
6,000
5Y
0

Steel available
Zinc available
Models A vs B
Non-negativity

Y
300
285
270
255
240
225

P a y o f f : 9 0 .0 0 X + 7 0 .0 0 Y = 1 8 2 0 0 .0 0

210
195
180
165
150
135
120

: 2 0 .0 0 X + 3 0 .0 0 Y = 6 0 0 0 .0 0

105
90
75

: 1 .0 0 X - 5 .0 0 Y = 0 .0 0

60

: 1 2 0 .0 0 X + 1 0 0 .0 0 Y = 2 4 5 0 0 .0 0

45
30
15
0
0

15

30

45

60

75

90

105

120

135

150

165

180

195

210

225

O p t im a l D e c is io n s ( X ,Y ) : ( 1 7 5 .0 0 , 3 5 .0 0 )
: 1 2 0 .0 0 X + 1 0 0 .0 0 Y < = 2 4 5 0 0 .0 0
: 2 0 .0 0 X + 3 0 .0 0 Y < = 6 0 0 0 .0 0
: 1 .0 0 X - 5 .0 0 Y < = 0 .0 0

See file P2-29.XLS.

A
B
Number of units 175.00 35.00
Profit
$90
$70 $18,200.00

240

255

270

285

300

2-30. Let X = number of benches to produce, Y = number of tables to produce.

Objective: Maximize profit = $9X + $20Y
Subject to:
4X + 6Y
10X + 35Y
X
X, Y

1,000
3,500
2Y
0

Labor hours
Redwood
Bench vs Table
Non-negativity

Y
200
190
180
170
160
150
140
130

P a y o f f : 9 .0 0 X + 2 0 .0 0 Y = 2 5 7 5 .0 0

120

: 1 .0 0 X - 2 .0 0 Y = 0 .0 0

110
100

: 4 .0 0 X + 6 .0 0 Y = 1 0 0 0 .0 0

90
80
70
60
50

: 1 0 .0 0 X + 3 5 .0 0 Y = 3 5 0 0 .0 0

40
30
20
10
0
0

15

30

45

60

75

90

105

120

135

150

165

180

195

210

225

O p t im a l D e c is io n s ( X ,Y ) : ( 1 7 5 .0 0 , 5 0 .0 0 )
: 4 .0 0 X + 6 .0 0 Y < = 1 0 0 0 .0 0
: 1 0 .0 0 X + 3 5 .0 0 Y < = 3 5 0 0 .0 0
: 1 .0 0 X - 2 .0 0 Y > = 0 .0 0

See file P2-30.XLS.

Number of units
Profit

Bench
175.00
$9

Table
50.00
$20 $2,575.00

240

255

270

285

300

2-31. Let X = number of core courses, Y = number of elective courses.

Objective: Minimize wages = $2,600X + $3,000Y
Subject to:

X +Y
3X + 4Y
X
Y
X, Y
Y
69
66
63
60
57
54
51
48
45
42
39
36
33
30
27
24
21
18
15
12
9
6
3
0

60
205
20
20
0

Total courses
Credit hours
Min core
Min elective
Non-negativity

: 1 .0 0 X + 1 .0 0 Y = 6 0 .0 0

P a y o f f : 2 6 0 0 .0 0 X + 3 0 0 0 .0 0 Y = 1 6 6 0 0 0 .0 0

: 0 .0 0 X + 1 .0 0 Y = 2 0 .0 0
: 1 .0 0 X + 0 .0 0 Y = 2 0 .0 0

0
O
:
:
:
:

p t im a l D
1 .0 0 X +
0 .0 0 X +
3 .0 0 X +
1 .0 0 X +

9
e c is io
1 .0 0 Y
1 .0 0 Y
4 .0 0 Y
0 .0 0 Y

12

15

18

21

24

27

30

33

: 3 .0 0 X + 4 .0 0 Y = 2 0 5 .0 0

36

39

42

45

48

51

n s ( X ,Y ) : ( 3 5 .0 0 , 2 5 .0 0 )
> = 6 0 .0 0
> = 2 0 .0 0
> = 2 0 5 .0 0
> = 2 0 .0 0

See file P2-31.XLS.

Courses
Wages

Core Elective
35.00 25.00
$2,600 $3,000 $166,000

54

57

60

63

66

69

2-32. Let X = number of Alpha 4 routers to produce, Y = number of Beta 5 routers to produce
Objective: Maximize profit = $1,200X + $1,800Y
Subject to:
20X + 25Y
X
+Y
Y
X, Y

Y
100
95
90

780
35
X
0

Labor hours
Total routers
Alpha 4 vs Beta 5
Non-negativity

85
80
75
P a y o f f : 1 2 0 0 .0 0 X + 1 8 0 0 .0 0 Y = 5 1 6 0 0 .0 0

70
65
60
55
50
45

: - 1 .0 0 X + 1 .0 0 Y = 0 .0 0

40
35
: 1 .0 0 X + 1 .0 0 Y = 3 5 .0 0

30
25
20
15
10

: 2 0 .0 0 X + 2 5 .0 0 Y = 7 8 0 .0 0

5
0
0

10

15

20

25

30

35

40

45

50

55

O p t im a l D e c is io n s ( X ,Y ) : ( 1 9 .0 0 , 1 6 .0 0 )
: 2 0 .0 0 X + 2 5 .0 0 Y < = 7 8 0 .0 0
: 1 .0 0 X + 1 .0 0 Y > = 3 5 .0 0
: - 1 .0 0 X + 1 .0 0 Y < = 0 .0 0
: 2 0 .0 0 X + 2 5 .0 0 Y > = 7 8 0 .0 0

See file P2-32.XLS.

Number of units
Profit

Alpha 4 Beta 5
19.00 16.00
$1,200 $1,800 $51,600.00

60

65

70

75

80

85

90

2-33. Let X = barrels of pruned olives, Y = barrels of regular olives to produce

Objective: Maximize revenue = $20X + $30Y
Subject to:
5X
X
X
X,

+ 2Y
+ 2Y
Y

250
150
40
0

Labor hours
Acres available
Max pruned
Non-negativity

Y
100
95
90
85

: 1 .0 0 X + 0 .0 0 Y = 4 0 .0 0

80
75
70
65
60
55
50
45
40
35
30

: 1 .0 0 X + 2 .0 0 Y = 1 5 0 .0 0

25

: 5 .0 0 X + 2 .0 0 Y = 2 5 0 .0 0

20
15
10
5

P a y o f f : 2 0 .0 0 X + 3 0 .0 0 Y = 2 3 7 5 .0 0

0
0

10

15

20

25

30

35

40

45

50

55

60

65

70

75

80

85

O p t im a l D e c is io n s ( X ,Y ) : ( 2 5 .0 0 , 6 2 .5 0 )
: 5 .0 0 X + 2 .0 0 Y < = 2 5 0 .0 0
: 1 .0 0 X + 2 .0 0 Y < = 1 5 0 .0 0
: 1 .0 0 X + 0 .0 0 Y < = 4 0 .0 0

See file P2-33.XLS.

Number of barrels
Revenue

Pruned Regular
25.00 62.50
$20
$30 $2,375.00

Number of acres

25.00

125.00

90

95

100

2.34. Let X = dollars to invest in Louisiana Gas and Power, Y = dollars to invest in Trimex
Objective: Minimize total investment = X + Y
Subject to:
0.36X
1.67X
0.04X
X,
Y
3500
3325
3150
2975
2800
2625
2450
2275
2100
1925
1750
1575
1400
1225
1050
875
700
525
350
175
0

+ 0.24Y
+ 1.50Y
+ 0.08Y
Y

875
5,000
200
0

Short term appr

3-year appreciation
Dividend income
Non-negativity

: 1 .6 7 X + 1 .5 0 Y = 5 0 0 0 .0 0

: 0 .0 4 X + 0 .0 8 Y = 2 0 0 .0 0

: 0 .3 6 X + 0 .2 4 Y = 8 7 5 .0 0

250

500

750

1000

1250

1500

1750

P a y o f f : 1 .0 0 X + 1 .0 0 Y = 3 1 7 9 .3 4

2000

2250

2500

2750

3000

O p t im a l D e c is io n s ( X ,Y ) : ( 1 3 5 8 .7 0 , 1 8 2 0 .6 5 )
: 0 .3 6 X + 0 .2 4 Y > = 8 7 5 .0 0
: 1 .6 7 X + 1 .5 0 Y > = 5 0 0 0 .0 0
: 0 .0 4 X + 0 .0 8 Y > = 2 0 0 .0 0

See file P2-34.XLS.

$ invested
Investment

Louisiana Trimex
$1,358.70 $1,820.65
1
1
$3,179.35

3250

3500

3750

4000

4250

4500

4750

5000

2-35. Let X = number of coconuts to load on the boat, Y = number of skins to load on the boat.
Objective: Maximize profit = 60X + 300Y
Subject to:
5X
+ 15Y
0.125X + Y
X,
Y
Y
25
24
23
22
21
20
19
18
17
16
15
14
13
12
11
10
9
8
7
6
5
4
3
2
1
0

300
15
0

Weight limit
Volume limit
Non-negativity

: 5 .0 0 0 X + 1 5 .0 0 0 Y = 3 0 0 .0 0 0

: 0 .1 2 5 X + 1 .0 0 0 Y = 1 5 .0 0 0

P a y o f f : 6 0 .0 0 0 X + 3 0 0 .0 0 0 Y = 5 0 4 0 .0 0 0

10 12 14 16 18 20 22 24 26 28 30 32 34 36 38 40 42 44 46 48 50

O p t im a l D e c is io n s ( X ,Y ) : ( 2 4 .0 0 0 , 1 2 .0 0 0 )
: 5 .0 0 0 X + 1 5 .0 0 0 Y < = 3 0 0 .0 0 0
: 0 .1 2 5 X + 1 .0 0 0 Y < = 1 5 .0 0 0

See file P2-35.XLS.

Number carried
Profit (rupees)

Coconuts
24.00
60

Skins
12.00
300

5,040.00

2.36. Let X = number of boys bikes to produce, Y = number of girls bikes to produce.
Objective: Maximize profit = (225 - 101.25 - 38.75-20)X + (175 - 70 - 30-20)Y = $65X + $55Y
Subject to:
X
+Y
3.2X + 2.4Y
Y
X,
Y

Y
500

390
1,120
0.3(X+Y)
0

Production limit
Labor hours
Min Girls' bikes
Non-negativity

475
450
425
400
375

P a y o f f : 6 5 .0 0 X + 5 5 .0 0 Y = 2 3 7 5 0 .0 0

350
325
300
275
250

: 3 .2 0 X + 2 .4 0 Y = 1 1 2 0 .0 0

225
200

: - 0 .3 0 X + 0 .7 0 Y = 0 .0 0

175
150
125
100

: 1 .0 0 X + 1 .0 0 Y = 3 9 0 .0 0

75
50
25
0
0

25

50

75

100

125

150

175

200

225

250

275

300

O p t im a l D e c is io n s ( X ,Y ) : ( 2 3 0 .0 0 , 1 6 0 .0 0 )
: - 0 .3 0 X + 0 .7 0 Y > = 0 .0 0
: 3 .2 0 X + 2 .4 0 Y < = 1 1 2 0 .0 0
: 1 .0 0 X + 1 .0 0 Y < = 3 9 0 .0 0

See file P2-36.XLS.

Boys
Number of units 230.00
Profit
$65

Girls
160.00
$55 $23,750.00

325

350

375

400

425

450

475

500

2.37. Let X = number of regular modems to produce, Y = number of intelligent modems to produce
Objective: Maximize profits = $22.67X + $29.01Y
Subject to:
0.555X + Y
+Y
+Y
X,
Y

15,400
8,000
0.25(X + Y)
0

Direct labor
Microprocessor
Min intelligent
Non-negativity

Y
12000
11400
10800
10200
9600
9000

: 0 .5 5 5 X + 1 .0 0 0 Y = 1 5 4 0 0 .0 0 0
P a y o f f : 2 2 .6 7 0 X + 2 9 .0 1 0 Y = 5 6 0 6 4 0 .9 0 0
: 0 .0 0 0 X + 1 .0 0 0 Y = 8 0 0 0 .0 0 0

8400
7800
7200
6600
6000
5400
4800

: - 0 .2 5 0 X + 0 .7 5 0 Y = 0 .0 0 0

4200
3600
3000
2400
1800
1200
600
0
0

900

1800 2700

3600 4500

5400 6300

7200 8100

9000 9900

10800 11700 12600 13500 14400 15300 16200 17100 18000

O p t im a l D e c is io n s ( X ,Y ) : ( 1 7 3 3 5 .8 3 5 , 5 7 7 8 .6 1 2 )
: - 0 .2 5 0 X + 0 .7 5 0 Y > = 0 .0 0 0
: 0 .5 5 5 X + 1 .0 0 0 Y < = 1 5 4 0 0 .0 0 0
: 0 .0 0 0 X + 1 .0 0 0 Y < = 8 0 0 0 .0 0 0

See file P2-37.XLS.

Number of units
Profit

Regular Intelligent
17,335.83 5,778.61
$22.67
$29.01 $560,640.90

2.38. Let X = number of Mild servings to make, Y = number of Spicy servings to make.
Objective: Maximize profit = $0.58X + $0.45Y
Subject to:
0.15X + 0.30Y
0.36X + 0.40Y
3X
+ 2Y
+ 5Y
X,
+Y
Y
50
48
46
44
42
40
38
36
34
32
30
28
26
24
22
20
18
16
14
12
10
8
6
4
2
0

8.5
13
95
125
0

Beef
Beans
Homemade salsa
Hot sauce
Non-negativity

: 3 .0 0 X + 2 .0 0 Y = 9 5 .0 0

: 0 .0 0 X + 5 .0 0 Y = 1 2 5 .0 0

P a y o f f : 0 .5 8 X + 0 .4 5 Y = 1 9 .0 0
: 0 .1 5 X + 0 .3 0 Y = 8 .5 0

: 0 .3 6 X + 0 .4 0 Y = 1 3 .0 0

0 2 4 6 8 101214161820222426283032343638404244464850
O p t im a l D e c is io n s ( X ,Y ) : ( 2 5 .0 0 , 1 0 .0 0 )
: 0 .1 5 X + 0 .3 0 Y < = 8 .5 0
: 0 .3 6 X + 0 .4 0 Y < = 1 3 .0 0
: 3 .0 0 X + 2 .0 0 Y < = 9 5 .0 0
: 0 .0 0 X + 5 .0 0 Y < = 1 2 5 .0 0

See file P2-38.XLS.

Number of units
Profit

Mild
25.00
$0.58

Spicy
10.00
$0.45

$19.00

2.39. Let R = number of Rocket printers to produce, O, A defined similarly.

Objective: Maximize profit = $60R + $90O + $73A
Subject to:
2.9R + 3.7O + 3.0A
1.4R + 2.1O + 1.7A
O
R
+O
R,
O,
A

4,000
2,000
0.15(R + O + A)
0.40(R + O + A)
0

Assembly time
Testing time
Min Omega
Min Rocket & Omega
Non-negativity

See file P2-39.XLS.

Number of units
Profit

Rocket
296.74
$60

Omega
178.04
$90

Alpha
712.17
$73

$85,816.02

2-40. Let X = pounds of Stock X to mix into feed for one cow, Y, Z defined similarly.
Objective: Minimize cost = $3.00X + $4.00Y + $2.25Z
Subject to:
3X + 2Y
2X + 3Y
X
6X + 8Y
X,

Y,

+ 4Z
+Z
+ 2Z
+ 4Z
Z

64
80
16
128
5
0

Nutrient A needed
Nutrient B needed
Nutrient C needed
Nutrient D needed
Stock Z max
Non-negativity

See file P2-40.XLS.

# of pounds
Cost

Stock X Stock Y Stock Z

16.00 16.00
0.00
$3.00 $4.00 $2.25 $112.00

2.41. Let J = number of units of XJ201 to produce, M, T, B defined similarly.

Objective: Maximize profit = $9J + $12M + $15T + $11B
Subject to:
0.5J
0.3J
0.2J
0.5J
J

+ 1.5M
+ 1.0M
+ 4.0M
+ 1.0M

+ 1.5T
+ 2.0T
+ 1.0T
+ 0.5T

+ 1.0B
+ 3.0B
+ 2.0B
+ 0.5B

M
T
J,

M,

B
B

T,

15,000
17,000
10,000
12,000
150
100
300
400
0

Wiring time
Drilling time
Assembly time
Inspection time
Minimum XJ201
Minimum XM897
Minimum TR29
Minimum BR788
Non-negativity

See file P2-41.XLS.

XJ201 XM897 TR29 BR788
# of units 20,650.00 100.00 2,750.00 400.00
Profit
$9
$12
$15
$11 $232,700.00

2-42. Let M1 = number of X409 valves to produce, M2, M3, M4 defined similarly.
Objective: Maximize profit = $16M1 + $12M2 + $13M3 + $8M4
Subject to:
0.40M1
0.60M1
1.20M1
0.25M1
M1

+ 0.30M2
+ 0.65M2
+ 0.60M2
+ 0.25M2

+ 0.45M3
+ 0.52M3
+ 0.50M3
+ 0.25M3

+ 0.35M4
+ 0.48M4
+ 0.70M4
+ 0.25M4

M2
M3
M1,

M2,

M 3,

M4
M4

700
890
1,200
525
200
250
600
450
0

Drilling time
Milling time
Lathe time
Inspection time
Minimum X409
Minimum X3125
Minimum X4950
Minimum X2173
Non-negativity

See file P2-42.XLS.

# of valves
Profit

X409 X3125 X4950 X2173

332.50 250.00 600.00 450.00
$16
$12
$13
$8 $19,720.00

2.43. Let P = cans of Plain nuts to produce. M, R defined similarly

Objective: Maximize revenue = $2.25P + $3.37M + $6.49R
Subject to:
0.8P + 0.5M
0.2P + 0.3M
+ 0.1M
+ 0.1M
P
P,
M,

+ 0.3R
+ 0.4R
+ 0.4R
R

500
225
100
80
2R
0

Peanuts
Cashews
Almonds
Walnuts
Plain vs Premium
Non-negativity

See file P2-43.XLS.

Number of cans
Revenue

Plain Mixed Premium

375.00 400.00 100.00
$2.25 $3.37
$6.49 $2,840.75

2.44. Let B = dollars invested in B&O. S, R defined similarly.

Objective: Minimize investment = B + S + R
Subject to:
0.39B
1.59B
0.08B
B,

+ 0.26S
+ 1.70S
+ 0.04S
S,

+ 0.42R
+ 1.55R
+ 0.06R
R

$1,000
$6,000
$250
0

Short term growth

Intermediate growth
Dividend income
Non-negativity

See file P2-44.XLS.

$ invested
Investment

B&O
Short
Reading
$2,555.25 $1,139.50 $0.00
1
1
1
$3,694.75

2-45. Let S = number of Small boxes to include, L, M defined similarly.

Objective: Maximize rent collected = $30S + $40L + $17M
Subject to:
0.50S + 0.85L + 0.30M
+ 0.85L + 0.30M
S
+L
+M
L
M
S,
L,
M

240
120
350
80
100
0

Square feet available

Max space, large & mini
Min required, total
Min required, large
Min required, mini
Non-negativity

See file P2-45.XLS.

Number of boxes
Rent

Small
284.00
$30

Large
80.00
$40

Mini
100.00
$17 $13,420.00

Case: Mexicana Wire Works

See file P2-Mexicana.XLS.
W75C W33C W5X W7X
Number of units 1,100.00 250.00 0.00 600.00
Profit
$34
$30
$60
$25 $59,900.00
Constraints
Drawing time
1
2
1
$2,200.00
Extrusion time
1
1
4
1
$1,950.00
Winding time
1
3
$1,850.00
Packaging time
1
3
2
$2,300.00
W75C orders
1
$1,100.00
W33C orders
1
$250.00
W5X orders
1
$0.00
W7X orders
1
$600.00
Minimum W75C
1
$1,100.00
Minimum W7X
1
$600.00
LHS

<=
<=
<=
<=
<=
<=
<=
<=
>=
>=
Sign

4000
4200
2000
2300
1400
250
1510
1116
150
600
RHS

Case: Golding Landscaping and Plants, Inc.

See file P2-Golding.XLS.
# of pounds
Cost
Constraints
50-lbs required
E-11 15%
C-92 & C-30 45%
D-21 & C-92 30%

C-30
7.50
$0.12

C-92
15.00
$0.09

D-21
0.00
$0.11

E-11
27.50
$0.04

1
1

1
1

$3.35
50.00 =
27.50
22.50
15.00
LHS Sign

50.0
7.5
22.5
15.0
RHS