Reference no: EM132202198
1. When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and
A) finding the profit at every corner point of the feasible region to see which gives the hight value.
B) moving the isoprofit lines in any direction
C) locating the point that is the best pro on the graph
D) none of the above
E) all of the above
2. When a constraint line bounding a feasible region has the same slope as an isoprofit line (runs perfectly parallel),
A) there may be more than one optimum
B) the problem involves redundancy
C) an error has been made in the problem formulation
D) a condition of infeasibility exists
E) none of the above
3. Consider the following linear programming problem maximize subject to : 4x + 10y 3x + 4y<=480 4x + 2y <=360 all variables>=0 The feasible corner point are (48,84),(0,120),(0,0),(90,0). what is the maximum possible value for the object function ?
A) 1032
B) 1200
C) 360
D) 1600
E) none of the above