www.vutube.edu.

pk
Assignment: # 04 (Fall 2007)
MTH601 (Operations Research)
Lecture: 18 – 22
Total Marks = 30
INSTRUCTIONS

Please read the following instructions before attempting to solve this assignment
1. In order to attempt this assignment you should have full command on
Lecture # 18 to Lecture # 22
2. In order to solve this assignment you have strong concepts about following topics
 Concept of Network.
 Rules for construction of Network.
3. Try to get the concepts, consolidate your concepts and ideas from these questions
which you learn in Lecture #18 to Lecture # 22
4. You should concern recommended books for clarify your concepts as handouts
are not sufficient.
5. Try to make solution by yourself and protect your work from other students. If we
found the solution files of some students are same then we will reward zero marks
to all those students.
6. You are supposed to submit your assignment in Word format any other formats
like scan images, PDF format etc will not be accepted and we will give zero
marks to these assignments.
Assignments through e-mail are not acceptable after due date (If there is any problem in
submitting your assignment through LMS, you can send your solution file through email
with in due date). You are advised to upload your assignment at least two days before
Due date.

Q: # 01. (Marks: 10).

An animal food company must produce 200kg. of a mixture consisting of

ingredients x1 and x2 daily. x1 costs Rs.3/- per kg. and x2 Rs.8/- per kg. No
more than 80 kg. of x1 can be used and at least 60 kg. of x2 must be used.
Formulate a LP. model to minimize the cost.
Solution:

Decision Variables:

Let x1 & x2 no. of ingredients contents in mixture.

Objective Function:

 the cost of two ingredients are given

 we have to minimize the cost
 Objective Function is
Min : Z  3 x1  8 x 2

Constraints:

There are three restrictions be imposed on production of ingredients

which are
x1  x 2  200
x1  80
x 2  60
x1, x 2  0

Finally Linear Programming Problem is

Min : Z  3 x1  8 x 2
Subject to
x1  x 2  200
x1  80
x 2  60
x1, x 2  0

Q: # 02. (Marks: 10).

Solve graphically the following linear programming problem

MinZ  3x  2 y
Subject to
 2 x  3 y  9

x  5 y  20

x, y  0
Solution:

For Linear Programming Problem

Min Z  3x  2 y
Subject to
 2 x  3 y  9      (1)
x  5 y  20      (2)
x, y  0
First we consider linear equations corresponding to the given constraints;

 2 x  3 y  9    (11)
x  5 y  20    ( 22)
To draw straight line (11)
i) Put y  0 in (11)
 2 x  9
 x  4.50
So the st: line meets x-axis at ‘ x  4.50 ’
ii) Put x  0 in (11)
 2(0)  3 y  9
y3
So the st: line (11) meets y-axis at ‘y=3’
To draw st: line (22)
i) Put y  0 in (22)
So x  20 implies that the straight line meets the x-axis at x  20
ii) Put x  0
So y  4 implies that the straight line meets y-axis at y  4

Linear Constraints x, y  0
 the graphical solutions restricted to 1st quadrants
For the solution region
Put (x,y)=(0,0) in (1)
 2(0)  3(0)  20 that is true
 Its solution region is on the origin side
Put (x,y)=(0,0) in (2)
0  5(0)  20
 Its solution region is on the origin side
Restrictions
x, y  0 implies that the solution region is limited to the 1st quadrant.
Finally about the optimality we see that the feasible region is unbounded (non-restricted)
as there does not exists a circle which can engulf the feasible region.
Hence the given linear programming problem has no optimal solution.

Q: # 03. (Marks: 10).

Use Simplex method to solve the linear programming problem

MaxZ  15x1  6 x2  9 x3  2 x4

subject to
2 x1  x2  5x3  6 x4  20

3x1  x2  3x3  25 x4  24

7 x1  x4  70

x1 , x2 , x3 , x4  0
 Solution:

Rewrite the inequalities of the constraints into equations by adding slack variables
s1, s 2 & s3 then the standard form of the LPP becomes

MaxZ  15 x1  6 x 2  9 x3  2 x 4  0 s1  0 s 2  0 s3

subject to

2 x1  x 2  5 x3  6 x 4  s1  20
3 x1  x 2  3x3  25 x 4  s 2  24
7 x1  x 4  s3  70
x1, x 2, x3, x 4, s1, s 2, s3  0

The initial basic feasible solution is s1  20, s 2  24, s3  70 as the non-basic

solution is

x1  x 2  x3  x 4  0

The initial simplex table is give

CB B XB X1 X2 X3 X4 S1 S2 S3 Min
 XB 
 
 X1 
0 S1 20 2 1 5 6 1 0 0 20/10

0 S2 24 3 1 3 25 0 1 0 24/3=8

0 S3 70 7 0 0 1 0 0 1 70/7=10
Zj 0 0 0 0 0 0 0 0

Zj-Cj -15 -6 -9 -2 0 0 0

As some of ‘ Zj  Cj  0 ’the current basic feasible solution is not optimum.

Zj  Cj =-15 is the most negative value and hence x1 enters the basic value and
the variable S 2 leaves the basis.

1ST ITERATION:

CB B XB X1 X2 X3 X4 S1 S2 S3 Min
 XB 
 
 X1 
 S1 4 0 1/3 3 -32/3 1 -2/3 0 4/(1/3)=12
0
X1 8 1 1/3 1 25/3 0 1/3 0 8/(1/3)=24
15
S3 14 0 -7/3 -7 -172/3 0 -7/3 1 ----------
0
Zj 120 15 5 15 125 0 5 0

Zj-Cj 0 -1 6 123 0 5 0


Since Z 2  C 2  1  0 , the solution is not optimal and therefore x 2 enters the basis
and the basic variable S1 leaves the basis.

2nd ITERATION:

CB B XB X1 X2 X3 X4 S1 S2 S3
6 X2 12 0 1 9 -32 3 -2
Since all Zj  Cj  0, the
15 X1 4 1 0 -2 57/3 -1 1 solution is optimal & is given
by
0 S3 42 0 0 14 -132 7 -7
Zj 132 15 6 24 93 3 3 MaxZ=132, X1=4, X2=12,
X3=0, X4=0
Zj-Cj 0 0 15 91 3 3