Week 2 Tutorial MGM 3163 Teknik Kuantitatif untuk Perniagaan Semester Kedua 2011-2012

Topic: Linear Programming - Graphical Method 2.1 Consider the following linear program:. Max s.t. 1 X1 1 X1 2 X1 X1 + 1 X2 2 X2 X2 2.2 + 2 X2 = 5 4 12 0 0 a) Show the feasible region b) What are the extreme points of the feasible region? c) Find the optimal solution using the graphical procedure.

Consider the following linear program: Min s.t. 2 X1 1 X1 3 X1 1 X1 X1 + + + 2 X2 3 X2 1 X2 1 X2 = X2 12 1 3 3 0 0 a) Show the feasible region b) What are the extreme points of the feasible region? c) Find the optimal solution using the graphical procedure.

2.3

For the linear program Min s.t. 6 X1 2 X1 1 X1 X1 + + + 4 X2 1 X2 1 X2 1 X2 X2 12 1 0 4 0 0 a) Write the problem in standard form. b) Solve the problem using the graphical solution procedure. c) What are the values of the slack and surplus variables?

2.4

For the linear program Max s.t. 1 X1 8 X1 4 X1 X1 + + + 1 X2 6 X2 6 X2 2 X2 X2 24 -12 4 0 0 Does the linear program involve infeasibility, unbounded, and/or alternative optimal solutions? Explain.