DEPARTMENT OF COMPUTER SCIENCE

AND BUSINESS SYSTEMS

ASSIGNMENT – I

U20BST440 – OPERATIONS RESEARCH

SUBMITED BY SUBMITTED TO
Name: Mr. V. Vasanth
Reg. Number: Assistant Professor
Section : SMVEC
 DEPARTMENT OF COMPUTER SCIENCE AND BUSINESS SYSTEMS
U20BST440 - OPERATIONS RESEARCH
WORK SHEET-I

NAME:

DEPT. / SEC:
---------------------------------------------------------------------------------------------------------------------------

1. Solve the following LPP by graphical method

MaxZ = 100 x1 + 80 x 2
Subject to
5 x1 + 10 x 2  50
8 x1 + 2 x 2  16,
3x1 − 2 x 2  6, x1 , x 2  0

Solution:

Convert the inequality to equality

To find the points:

5 x1 + 10 x 2 = 50 8x1 + 2 x2 = 16 3x1 − 2 x2 = 6
 Graph To find the intersection points:

Corner Points Value of Z = 100 x1 + 80 x2

Result:
2. Solve the following LPP by graphical method

MaxZ = 5 x1 + 7 x 2
Subject to
x1 + x 2  4
3x1 + 8 x 2  24,
10 x1 + 7 x 2  35, x1 , x 2  0

Solution:

Convert the inequality to equality

To find the points:

x1 + x2 = 4 3 x1 + 8 x 2 = 24 10 x1 + 7 x2 = 35
Graph To find the intersection points:

Corner Points Value of Z = 5 x1 + 7 x2 2

Result
3. Solve the following LPP by graphical method

MiniZ = 60 x1 + 40 x2
Subject to
10 x1 + 5 x2  1400
6 x1 + 10 x2  1400, x1 , x2  0

Solution:

Convert the inequality to equality

To find the points:

10 x1 + 5x2  1400 6 x1 + 10 x2  1400

Graph To find the intersection points:

Corner Points Value of Z = 60 x1 + 40 x2

9200

Result
 Formation of LPP

1. A manufacturer of furniture makes two products: Chairs and Tables. Processing of these

products is done on two machines A & B. A chair requires 2 Hrs. On machine A and 6 Hrs. On

machine B. A table required 5Hrs. On machine A and no time on machine B. There are 16

Hrs. Of time per day available on machine A and 30Hrs. On machine B. Profit gained by

manufacturer from chair and table is Rs. 1 and Rs. 5 respectively. What should be daily

production of each of the two products? Formulate only LPP model.

Solution:

2. Akash wishes to purchase fans and sewing machines. He has only Rs.5760 to invest and has

space for at the most 20 items. A fan cost Rs. 360 and sewing machine Rs.240. His expectation is

that he can sell a fan at a profit of Rs.22 and a sewing machine at a profit of Rs. 18. How should

he invest his money to maximize profit?

Solution:
3. An aero plane can carry a maximum of 200 pessengers. A profit Rs. 400 is made on each first

class tickets and a profit of Rs. 300 on each economy class tickets. The airlines reserves at least

20 seats for first class. However, at least 4 times as many passengers prefer to travel by economy

class than by the first class. Determine how many of each type of tickets must be sold to

maximize the profit of the airlines? What is the maximum profit?.

Solution:

1. Using simplex method solve the LPP

𝑴𝒂𝒙 𝒛 = 𝒙𝟏 + 𝒙𝟐 + 𝟑𝒙𝟑
Subject to
𝟑𝒙𝟏 + 𝟐𝒙𝟐 + 𝒙𝟑 ≤ 𝟑
𝟐𝒙𝟏 + 𝒙𝟐 + 𝟐𝒙𝟑 ≤ 𝟐, 𝒘𝒉𝒆𝒓𝒆 𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 ≥ 𝟎

Solution:
Rewrite the inequality of the constraints into an equation by adding slack variables.

𝑀𝑎𝑥 𝑧 = 𝑥1 + 𝑥2 + 3𝑥3 + 0𝑆1 + 0𝑆2

Subject to
3𝑥1 + 2𝑥2 + 𝑥3 + 𝑆1 = 3

2𝑥1 + 𝑥2 + 2𝑥3 + 𝑆2 = 2, 𝑤ℎ𝑒𝑟𝑒 𝑥1 , 𝑥2 , 𝑥3 ≥ 0

Initial basic feasible solution is,

𝑥1 = 𝑥2 = 𝑥3 = 0
Initial simplex table:
𝐂𝐣 𝟏 𝟏 𝟑 𝟎 𝟎
𝐶𝐵 Basic 𝑥1 𝑥2 𝒙𝟑 𝑆1 𝑆2 Solution Mini.
variable Ratio

Zj
Zj − Cj
Here 𝒙𝟑 is the entering variable and 𝐒𝟐 is the leaving variable.

First Iteration:
𝐂𝐣 𝟏 𝟏 𝟑 𝟎 𝟎
𝐶𝐵 Basic 𝑥1 𝑥2 𝒙𝟑 𝑆1 𝑆2 Solution Mini.
variable Ratio

0
=
0
=
Zj
Zj − Cj

Since all Zj − Cj ≥ 0, the solution is optimum and it is given by 𝑥1 = 0, 𝑥2 = 0, 𝑥3 = 1

Max Z = 3.

2. Using Big M method solve the LPP

𝑴𝒊𝒏 𝒛 = 𝟐𝒙𝟏 + 𝟑𝒙𝟐
Subject to
𝒙𝟏 + 𝒙𝟐 ≥ 𝟔
𝟕𝒙𝟏 + 𝒙𝟐 ≥ 𝟏𝟒,
𝒘𝒉𝒆𝒓𝒆 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎

Solution:
Since the given objective function is of minimization, we shall convert into maximaization using
Min Z = Max (-Z)
Rewrite the inequality of the constraints into an equation by adding slack surplus and
artificial variables.

𝑀𝑎𝑥 𝑧 =
Subject to

Initial basic feasible solution is,

Initial simplex table:

 𝐂𝐣
𝐶𝐵 Basic Solution Mini.
variable Ratio

=
Zj 0 0 0 0 0 0 0
Zj − Cj 1 -3 2 0 0 0
Here is the entering variable and is the leaving variable.

First Iteration:
𝐂𝐣
𝐶𝐵 Basic Solution Mini.
variable Ratio

=
Zj
Zj − Cj
Here is the entering variable and is the leaving variable.

Second Iteration
𝐂𝐣
𝐶𝐵 Basic 𝑥2 𝑥3 𝒙𝟓 𝑆1 𝑆2 𝑆3 Solution Mini.
variable Ratio

=
Zj
Zj − Cj

Third Iteration
𝐂𝐣
𝐶𝐵 Basic 𝑥2 𝑥3 𝒙𝟓 𝑆1 𝑆2 𝑆3 Solution Mini.
variable Ratio

=
Zj
Zj − Cj

Since all Zj − Cj ≥ 0, the solution is optimum and it is given by

Max Z=
Min Z = -Max Z=

3. Using Two phase simplex method solve the LPP

𝑴𝒂𝒙𝒛 = 𝟏𝟐𝒙𝟏 + 𝟏𝟖𝒙𝟐 + 𝟏𝟓𝒙𝟑

Subject to
𝟒𝒙𝟏 + 𝟖𝒙𝟐 + 𝟔𝒙𝟑 ≥ 𝟔𝟒

𝟑𝒙𝟏 + 𝟐𝒙𝟐 + 𝟏𝟐𝒙𝟑 ≥ 𝟗𝟔

𝒘𝒉𝒆𝒓𝒆 𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 ≥ 𝟎

Solution:
Rewrite the inequality of the constraints into an equation by adding slack variables.

Initial basic feasible solution is,

Phase I
Initial table:

𝐂𝐣
𝐶𝐵 Basic Solution Mini.
variable Ratio

=
Zj
Zj − Cj

First Iteration:

𝐂𝐣
𝐶𝐵 Basic Solution Mini.
variable Ratio

=
Zj
Zj − Cj

Second Iteration:

𝐂𝐣
 𝐶𝐵 Basic Solution Mini.
variable Ratio

=
0 S3
=
Zj
Zj − Cj

Phase -II
Solution:

𝐶𝐵 Basic Solution Mini.

variable Ratio

=
Zj
Zj − Cj

Result:

4. Using Dual method solve the LPP

𝑴𝒊𝒏 𝒛 = 𝟐𝟒𝒙𝟏 + 𝟑𝟎𝒙𝟐

Subject to
𝟐𝒙𝟏 + 𝟑𝒙𝟐 ≥ 𝟏𝟎

𝟒𝒙𝟏 + 𝟗𝒙𝟐 ≥ 𝟏𝟓
𝟔𝒙𝟏 + 𝟔𝒙𝟐 ≥ 𝟐𝟎
𝒘𝒉𝒆𝒓𝒆 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎

Solution:

The standard canonical form is

The corresponding dual problem is

Initial simplex table:

𝐂𝐣
𝐶𝐵 Basic Solution Mini.
variable Ratio

=
Zj
Zj − Cj

First Iteration:

𝐂𝐣
𝐶𝐵 Basic Solution Mini.
variable Ratio

=
Zj
Zj − Cj

Second Iteration:

𝐂𝐣
𝐶𝐵 Basic Solution Mini.
variable Ratio

=
Zj
Zj − Cj

Solution: