Question: (25 points) Consider the following linear programming problem (LP): max X 2 s.t. 3.x1 + 5x2 0 X1, X2 > 0. (a) (10 points) Find

(25 points) Consider the following linear

(25 points) Consider the following linear programming problem (LP): max X 2 s.t. 3.x1 + 5x2 0 X1, X2 > 0. (a) (10 points) Find an optimal solution to the LP by using graphical method. (b) (5 points) Can you change the objective function to make the LP have multiple optimal solutions? If your answer is no, explain why. If your answer is yes, what is your new objective function? (c) (5 points) Can you add one more constraint to make the LP infeasible? If your answer is no, explain why. If your answer is yes, what constraint would you like to add? (d) (5 points) Can you remove one constraint to make the LP unbounded? If your answer is no, explain why. If your answer is yes, which constraint would you like to remove

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer

Step: 1 Unlock blur-text-image

Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock

Step: 3 Unlock

Students Have Also Explored These Related General Management Questions!

2. (20p) Consider the following linear programming problem (P): (max) f = 3n X1 + 2n x2 2x1 + x2 > 10 - 3x1 + 2x2 6 m X1 20, x2 > 0 m=4 n = 4 b) Determine an optimal solution. How many optimal...

(4) (7 points) Each type i store must be given a "finishing allowance" of Li dollars per square foot, in such a way that the total of all finishing allowances does not exceed a fixed budget equal to...

Consider the following linear programming problem: Max Z = X1 + 5X2 Subject to (1) X1 + X2 = 0 X1, X2 >= 0 (a) Graph the constraint lines and mark them clearly with the numbers (1), (2) and (3) to...

Consider the following linear programming problem: Max Z = X1 + 5X2 Subject to (1) X1 + X2 = 0 (a) Graph the constraint lines and mark them clearly with the numbers (1), (2) and (3) to indicate which...

Consider the following linear programming problem: Max Z = X1 + 5X2 Subject to (1) X1 + X2 = 0 X1, X2 >= 0 (a) Graph the constraint lines and mark them clearly with the numbers (1), (2) and (3) to...

18 moints) Consider the following linear programming problem Max z = -x + 3x s.t. X1 + X2 S8 (1) Xi - X2 S 2 X2SS (3) X1, X220 (4) & (5) (a) (2 point) Graph the constraints, feasible set, and the...

Figure 1: A B X 3 Number to Make: OBJ. FN. VALUE: . Unit profit: Constraints: Used Available 120 Figure 1 demonstrates an Excel spreadsheet that is used to model the following linear programming...

Problem 1 (22 points) Consider the following linear programming problem: Max Z = X1 + 5X2 Subject to (1) Xi + X2 =0 X1, X2 >=0 (a) Graph the constraint lines and mark them clearly with the numbers...

7) (4 points) Max Z = 5x1 + 3x2 Subject to: 6x1 + 2x2 0 Determine the sensitivity range for each objective function coefficient. Answer: xl: 8) (4 points) The relationship d= 5000 - 25p describes...

+ Problem 6. (12 marks in total) Consider the following linear programming problem: Max Z=3x, +5x2 +6X3 s.t. 2x, + x2 + x2 54 X, +2x2 + x2 54 X, +x2 + 2x, 54 X, + x2 + x2 53 X1, X2, X, 20 a. (1 mark)...

1. Which of the following statements is true regarding the leverage of supply-chain savings? A) Supply chain leverage is about the same for all industries. B) Supply chain savings exert more leverage...

Q16) (Managing Free Space) Free disk space can be kept track of using a free list or a bitmap. Disk addresses require D bits. For a disk with B blocks, F of which are free, state the condition under...

Where in OuickBooks can you find out the stahis of what you owe to a vendor and when it's due? Open Purchase Orders liat The money bar at the lap of the Vendors center Cash Flow report Accourts...

Case Greenbuilders Pte Lid ("GPL") is a local construction company which specialises in providing bespoke Design and Build construction services for private residential homes that are designed to be...