Consider the following problem.
Maximize Z = 2x1 + x2,
Subject to

and
x1 ‰¥ 0, x2 ‰¥ 0.

(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.

(c) Use hand calculations to solve this problem by the simplex method in algebraic form.

(d) Now use IOR Tutorial to solve this problem interactively by the simplex method in algebraic form.

(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 a software package based on the simplex method to solve the problem.

Transcribed Image Text:

i2 40