Professional Documents
Culture Documents
TUTORIAL 2
Linear Programming with Simplex Method
Question 1
Solve the following LP problems using simplex method:
c) M inimize Z 2 x1 5 x 2 d) Maximize Z 5 x1 6 x 2
Subject to 3x1 8 x 2 12 Subject to x1 x 2 2
2 x1 3x 2 6 x 2 10
x1 0, x 2 0 x1 0, x 2 0
Question 2
A company manufactures three products: X, Y and Z. Each product requires machine time and
finishing time as show in the following table:
The numbers of hours of machine time and finishing time available per month are 900 and
5,000, respectively. The unit profit on X, Y and Z is $6, $8 and $12 respectively. What is the
maximum profit per month that can be obtained? Use simplex method to find the optimal
solution.
Question 3
Jane & Joe Company has two types of data analytics services: A and B. The cost of performing
an A-type and B-type services is RM200 and RM240, respectively. Clients are charged RM280
per unit for A-type service and RM320 per unit for B-type service. The availability of a work
station for the services is limited to 60 hours. The total man-hours available is 400. The A-type
service requires 6 hours on the work station and 2 man-hours. The B-type service requires 2
hours on the work station and 4 man-hours. The company’s objective is to maximize profit.
_____________________________________________________________________________________
RAR 1
BDS4614 MANAGEMENT DECISION SCIENCE TRI 2, 2017/18
Question 4
Consider the following LP problem,
M inimize Z 3x1 5 x 2
Subject to 6 x1 4 x 2 24
4 x1 2 x 2 12
x1 0, x 2 0
a) Set up the initial simplex tableau by including the necessary slack, surplus and artificial
variables.
b) Use simplex method to find the final tableau.
Final answers:
Q1 a) x1 = 3 and x2 = 0; Max A = 9.
b) x1 = 2/3, x2 = 8/3; maximum z = 28/3
c) x1 = 0, x2 = 3/2; minimum z = -15/2
d)LP is unbounded
_____________________________________________________________________________________
RAR 2