Question: Consider the following linear program: Max A + 2B S.t. (1) 2A + 3B 4 (2) 3A -5B$12 (3) 2A + 58 27 15 minutes
Consider the following linear program: Max A + 2B S.t. (1) 2A + 3B 4 (2) 3A -5B$12 (3) 2A + 58 27 15 minutes on slide A and B 2 0 and "B" to be integer The figure to the right shows the constraint lines. a) Sketch and place a number (1, 2, or 3) next to each constraint line to identify which constraint it represents. b) Shade in the feasible region (or use the dot or line representation for ILP) on the graph. c) Identify the optimal extreme point. What is the optimal solution? d) Which constraints are binding in LP relaxation? Explain. Graph of the Constraint Lines B
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
