0
15
30
45
y
2.4x + 3.2y = 140
0.0x + 2.6y = 80
4.1x + 0.0y = 120
Iso–value line
15 30 45 60
x
The function is maximized when x = 17.30 and y = 30.76.
26) Graphical solution not given. Refer to Section 9.5.1 (page 275) for guidance.
27) Graphical solution not given. Refer to Section 9.5.1 (page 275) for guidance.
28) There are four available options to determine if the redesign alternative is worthwhile.
These are as follows: (a) with the optimization space in mind, as in Figure 9.20 (page 278),
solve the three new linear constraint equations simultaneously to determine the coordinates
of extreme points 2, 3, 5, and 6 and pick the one that is a maximum distance from the
origin; (b) redraw Figure 9.20, guided by the new linear constraint equations, placing the
restrictions relative to each other to determine graphically the point that is a maximum
distance from the origin; (c) Repopulate the initial matrix of Table 9.14 (page 280) with the
new capacity values and profit coefficients and then proceed through the simplex
optimization algorithm by hand producing a series of tables as in the text; (d) secure a PC–
based simplex package and use it to receive inputs for the changed capacities and profit
coefficients and produce the new production program. Compare the result obtained from
the approach of your choice with the base case. Answer the question regarding the
desirability of choosing the alternative over the baseline design.