(a) Solve this problem graphically in a freehand manner. Also
identify all the CPF solutions.
(b) Now use IOR Tutorial to solve the problem graphically.
(e) Use hand calculations to solve this problem by the simplex
method in tabular form.
(f ) Now use IOR Tutorial to solve this problem interactively
by the simplex method in tabular form.

(g) Use LINGO software on the simplex method to
solve the problem.

(h) Using the optimal solution and the optimal tableau, identify the binding (active) constraints at the optimal solution, the values of the shadow prices of the two RHS, and the reduced costs of the two original variables x1 and x2.

4.4-3. Consider the following problem. Z = 2x + x2, Maximize subject to x + x = 40 100 4x1 + x and X 0, x = 0.