Saint GBA334 module 5 quizQuestionQuestion 1.1.Consider the following linear programming problem:Maximize 12X + 10YSubject to: 4X + 3Y≤4802X + 3Y≤360All variables≥0What is the optimum solution of (X,Y)?(Points : 5)X=480, Y = 360X=360, Y-480X=60, Y=80X=80, Y=60None of the aboveQuestion 2.2.When appropriate, the optimal solution to a maximization linear programming problem can befound 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 highestvalue.moving the isoprofit lines towards the origin in a parallel fashion until the last point in thefeasible region is encountered.locating the point that is highest on the graph.None of the aboveAll of the aboveQuestion 3.3.An LP formulation typically requires finding the maximum value of an objective whilesimultaneously maximizing usage of the resource constraints.(Points : 5)TrueFalseQuestion 4.4.Infeasibility in a linearprogramming problem occurs when(Points : 5)Preview Mode
This document has 7 pages. Sign in to access the full document!