Saint GBA334 module 5 quiz Question Question 1.1. Consider the following linear programming problem: Maximize 12X + 10Y Subject to: 4X + 3Y ≤ 480 2X + 3Y ≤ 360 All variables ≥ 0 What is the optimum solution of (X,Y)? (Points : 5) X=480, Y = 360 X=360, Y - 480 X=60, Y=80 X=80, Y=60 None of the above Question 2.2. When appropriate, the optimal solution to a maximization linear programming problem can be found by graphing the feasible region and (Points : 5) finding the profit at every corner point of the feasible region to see which one gives the highest value. moving the isoprofit lines towards the origin in a parallel fashion until the last point in the feasible region is encountered. locating the point that is highest on the graph. None of the above All of the above Question 3.3. An LP formulation typically requires finding the maximum value of an objective while simultaneously maximizing usage of the resource constraints. (Points : 5) True False Question 4.4. Infeasibility in a linear programming problem occurs when (Points : 5) there is an infinite solution. a constraint is redundant. more than one solution is optimal. the feasible region is unbounded. there is no solution that satisfies all the constraints given. Question 5.5. If the addition of a constraint to a linear programming problem does not change the solution, the constraint is said to be (Points : 5) unbounded. non - negative. infeasible. redundant. bounded. Question 6.6. Solve the following linear programming problem: Maximize 10X + 1Y Subject to: 4X + 3Y ≤ 36 2X + 4Y ≤ 40 Y ? 3 What is the maximum profit? (Points : 5) 36 40 3 6.75 70.5 Question 7.7. In the term linear programming, the word programming comes from the phrase "computer programming." (Points : 5) True F alse Question 8.8. The difference between the left - hand side and right - hand side of a greater - than - or - equal - to constraint is referred to as