How can you find the vertices of a feasible set in a linear programming problem?
Here is 1 that I'm trying to solve:
Given the linear programming problem
Minimize C = x + 4y subject to
x < 6
y < 10
x + y > 10
x > 0, y > 0
Use the method of corners to determine the where the minimum occurs, and give the minimum value.
a. ( 0 , 0 ) with C = 0
b. ( 10 , 6 ) with C = 34
c. ( 0 , 10 ) with C = 40
d. ( 6 , 10 ) with C = 46
e. ( 6 , 0 ) with C = 6
f. None of the above
Thanks!!
2007-02-08
15:21:29
·
4 answers
·
asked by
Anonymous
in
Mathematics