Question: Consider the following linear programming problem:
Max 3X1 + 5X2
St: 3X1 + 2X2 ≤ 12
X1 ≤ 3, X2 ≤ 5,
X1, X2 ≤ 0
(i) Convert this algebraic representation to a form suitable for a manual solution by the simplex algorithm.
(ii) Perform the first pivot step in the manual simplex algorithm. Explain what is going on. No need to torture yourself by going any further!
(iii) How would you go about solving the problem above if the inequality (1) were greaterthanorequalto rather than lessthanorequalto ?
(iv) Suppose variable X2 is continuous but is unconstrained in sign (i.e., it can be either positive or negative.) How would you handle this in your formulation?