In a maximization problem, when one or more of the solution variables and the profit can be made large without violating any constraints, the linear program has A) an infeasible solution. B) an unbounded solution. C) a redundant constraint. D) alternate optimal solutions. E) None of the above Which of the following is not a part of every linear programming problem formulation? A) an objective function B) a set of constraints C) non-negatively constraints D) a redundant constraint E) maximization or minimization of a linear function When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and the A) finding the profit at every corner point of the feasible region to see which one give the highest value. B) moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasible region is encountered. C) locating the point that is highest on the graph. D) None of the above E) All of the above The mathematical theory behind the linear programming states that an optimal solution to any problem will lie a(n) _____ of the feasible region. A) interior point or center. B) maximum point or minimum point C) corner point or extreme point D) interior point or extreme point E) None of the above Which of the following is not a property of linear programs? A) one subject function B) at least two separate feasible regions C) alternative courses of action D) one or more constraints E) objective function and constraints are linear The corner point solution method A) will always provide one, and only one, optimum. B) will yield different results from the isoprofit line solution method. C) requires that the profit from all corners of the feasible region be compared. D) requires that all corners created by all constraints be compared. E) will not provide a solution at an intersection or corner non-negativity constraints involve When a constraint line bounding a feasible region has the same slope as an isoprofit line. A) there may be more than one optimum solution. 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