Solving Linear Programming Problems
TURN THIS PAGE IN!
Team Name: ________KEY__________________
Members Present: ____________________________________________________________________
Section: ______________
Part I
1. ___unbounded_______
Minimum value of C possible?
YES
NO
Why or why not? The objective function has non-negative coefficients and the constraints include
x ≥ 0 and y ≥ 0. This means that a minimum exists for the linear programming problem.
____________________________________________________________________________________
2. a.
Corner Point
(50,100)
(50, 55)
(100, 30)
C = 67000x + 81000y
11,450,00
7,805,000
9,130,000
b. $7,805,000___; ____50_____; __55______
3. __640______
4. __No – the region is unbounded.______________________________________________________
__________________________________________________________________________________
__________________________________________________________________________________
©Texas A&M University Part II
1. _bounded________; Maximum value of R possible? YES
NO
Why or why not? Bounded regions have both a minimum and maximum value of the objective
function. ___________________________________________________________________________
____________________________________________________________________________________
2.
Corner Point R = 20x + 16y
(12, 10)
400
(12, 30)
720
(32, 20)
960
(40, 10)
960
3. Every point on the heavy line has the same maximum value of R, 960._____________________
__________________________________________________________________________________
__________________________________________________________________________________
4. __960___; __(32, 20)__; __(40, 10)__; R = 20x + 16y=__960_____
Slope-Intercept Form: _y = -1.25x + 60____ with _32_ ≤ x ≤ _40_.
5.
(x, y)
(32, 20)
Food Used
288
Leftover Food
0
Hours of Care Used
240
Leftover Hours
0
(36,15)
264
24
240
0
(40, 10)
240
48
240
0
© Texas A&M University