You are on page 1of 6

Operation Research

5th Semester (Mechanical)


Assignment : 1
Unit: 1

Uka Tarsadia University, Bardoli

C. G. Patel Institute of Technology, Bardoli


Maliba Campus

Page | 1

1. Arvind textile mill at ahmedabad has three operational machines (weaving, processing and
packing) with capacity to produce three different types of cloths namely suitings, shirtings and
woolens yielding the profit of Rs 2, Rs. 4 and Rs. 3 per meter respectively. One meter suiting
requires 3 minutes in weaving, 2 minutes in processing and 1 minute in packing 1 meter of
shirting requires 4 minutes in weaving, 1 minute in processing and 3 minutes in packing while
one meter woolen requires 3 minutes in each machine. In a week, total run time of each
department is 60, 40 and 80 hours of weaving, processing and packing machines respectively.
2. Forge india ltd. manufactures two type of products nail and screw and sells them at a profit of Rs.
2 on nail and Rs. 3 on type B. Each product is processed on two machines die forging and cutting.
Nail requires one minute of processing time on forging and two minutes on cutting machine;
screw requires one minute on forging machine and one minute on cutting machine. The forging
machine available for not more than 6 hour 40 minutes while cutting machine is available for 10
hours during any working day. Formulate LPP to minimize the cost
3. Upon completing the construction of his house Dr. Sharma discovers that 100 square feet of
plywood scrap and 80 square feet of white-pine scrap are in usable form for the construction of
tables and book cases. It takes 16 square feet of plywood and 8 square feet of white-pine to make
a table; 12 square feet of plywood and 16 square feet of white-pine are required to construct a
book case. By selling the finished the products to a local furniture store, Dr. Sharma can realize a
profit of Rs 25 on each table and Rs 290 on each book case. How may he most profitably use the
left-over wood? Formulate the LPP.
4. Apollo tyre ltd, mehsana produces two types of tyres. Each tyre of the first type requires twice as
much labour time as the second type. If all tyres are of the second type only, the company can
produce a total of 5000 tyres a day. The market limits daily sales of the first and second type to
1500 and 2500 tyres. Assuming that the profits per hat are Rs. 800 for type A and Rs. 500 for type
B, formulate the problem as a linear programming model in order to determine the number of hats
to be produced of each type so as to maximize the profit.
5. A patient consults a doctor to check up his ill health. Doctor examines him and advises him that
he is having deficiency of two vitamins, vitamin A and vitamin D. Doctor advises him to
consume vitamin A and D regularly for a period of time so that he can regain his health. Doctor
prescribes tonic X and tonic Y, which are having vitamin A, and D in certain proportion. Also
advises the patient to consume at least 40 units of vitamin A and 50 units of vitamin daily. The
cost of tonics X and Y and the proportion of vitamin A and D that present in X and Y are given in
the table below. Formulate LPP to minimize the cost of tonics.
Vitamins

Tonics

Daily
units.

requirement

in

X
Y
A
2
4
40
D
3
2
50
Cost in Rs. per unit.
5
3
6. Write dual of LPP of primal
Max Z= 6x1 + 8x2
S/t x1+2x2 40
3x1+2x2 = 20
x1, x2 0
7. A carter knows that he will need 40 napkins on a given day and 70 napkins the day after. He can
purchase the napkins at 20 paise each and, after they are purchased, he can have dirty napkins
laundered at 5 paise each for using the next day. In order to minimize his costs, how many
C. G. Patel Institute of Technology, Bardoli
Maliba Campus

Page | 2

napkins should he purchase initially and how many dirty napkins should have laundered.
Formulate the LPP.
8. Write the dual form of given LPP
Max Z= 3x1+2x2+3x3
S/t

2x1+2x2+1x3 20
2x1-1x2-1x3 12
x1,x2 0, x3 is unrestricted

9. Write dual of LPP of primal


Max Z = 40x1+60x2
S/t
5x1+2x2 20
4x1+ 32x2 36
x1, x2 0
10. Noohs Boats makes three different kinds of boats. All can be made profitably In this company,
but the companys monthly production is constrained by the limited amount of labour, wood and
screws available each month. The director will choose the combination of boats that maximizes
his revenue in view of the information given in the following table :
Input

Row boat

Canoe

Keyak

Monthly available

Labour (Hours)

12

1,260 hrs.

Wood (Board feet)

22

18

16

19,008 board feet

Screws (Kg.)

396 Kg.

Selling price (in


Rs.)

4,000

2,000

5,000

a) Formulate the above as a linear programming problem.


b) Solve it by simplex method.
11 Define the following Terminology

Slack variable
Surplus variable
Alternative
optimum solution
Key column

12
13
14
15
16

Infeasible
solution
Degenerac
y
Artificial
variable
Key row

Optimal
solution
Unbounde
d solution
Key
number

What is the role of surplus variable in simplex method?


How an unbounded solution is identified in a simplex table?
Define In feasible solution
With reference to simplex table, when does an alternate optimal solution exist?
In LPP, there are 6 variables and 4 constraints. How many BFS are there?
C. G. Patel Institute of Technology, Bardoli
Maliba Campus

Page | 3

17 With reference to simplex table, when does an infeasible solution exist?


18 Discuss the objective of Operations Research.
19 "Operations Research is a bunch of mathematical techniques to break industrial problems.
Critically comment.
20 What is a Operations Research model? Discuss the advantages of limitation of good
Operations
Research model.
21 Briefly explain the characteristics of Operations Research.
22 Discuss the various steps used in solving Operations Research problems.
23 Explain the concept, scope and tools of OR as applicable to business and industry.
24 Explain the limitation of the OR.
25 Explain the procedure followed in simplex method of solving linear programming problem.
26 Explain how a linear programming problem can be solved by graphical method and give
limitations of graphical method.
27 What is the difference between slack, surplus and artificial variables? How do they differ in
their structure and use?
28 Explain the concept of degeneracy in simplex method.
29
30
31
32
I.

II.

III.

IV.

Mention the important differences between Dual and primal in simplex methods.
Give the mathematical formulation of a simplex problem.
Explain the concept of duality.
Solve following problem with graphical and simplex methods.
Max. Z = 4X1 +5X2 +9X3 + VI.
11X4,
s/t
X 1 +X2 + X3 +X4
15,
7X 1 +5X2 + 3X3
+2X4 120,
3X1 +5X2 + 10X3
+15X4 100,
VII.
X 1 , X2 , X3 , X4 0
Max. Z = 5X1 + 3X2,
s/t
3X1 +5X2 15
5X1 +2X2 10
X1, X2 0.
Max. Z = 7X1 + 5X2,
VIII.
s/t -X1 -2X2 -6,
4X1 + 3X2 12,
X1, X2 0.
Max. Z = X1 +X2 + X3,
s/t
4X1 + 5X2 + 3X3
15,
10X 1 + 7X2 +X3
12,

Minimize Z = X2 3X3 + 2X5


s/t 3X 2 - X3 + 2 X5
7,
-2 X 2 + 4X3
12,
-4X 2 + 3X3 + 8X5
10,
X2 , X3, X5 0
Max. Z = 2X1 + X2,
s/t
X1 +2X2 10,
X1 +X2 6
X 1 - X2 2
X1 - 2X2 1
X1, X2 0.
Max. Z = 3X1 + 5X2,
s/t
3X1 +2X2 18,
X1 4,
X2 6,
X1, X2 0.

C. G. Patel Institute of Technology, Bardoli


Maliba Campus

Page | 4

V.

X1, X2, X3 0
Max. Z = X1 -X2 +3 X3,
s/t X1 + X2 + X3 10,
2X1 -X3 2,
2X1 - 2X2 + 3X3 0,
X1, X2, X3 0

33 Solve following problems by Two phase method


I.

1. Min. Z = X1 -2X2 -3 X3,


S/t
-2X1 +X2 +3 X3 =2
2X 1 +3X2 +4 X3 =1
X 1, X2, X3 0

II.

Max. Z = 5X1 -2X2 +3 X3,


s/t 2X1 +2X2 - X3 2,
3X1 -4X2 3,
X2 + 3X3 5,
X 1, X2, X3 0

34 Solve following problems by Big-M method


I.

Min. Z = 2X1 +9X2 + X3,


s/t X1 + 4X2 + 2X3 5,
3X1 + X2 + 2X3 4,
X1, X2, X3 0

II.

Max. Z = 2X1 +X2 + 3X3,


s/t X1 + X2 + 2X3 5,
2X1 + 3X2 +4X3 = 12,
X1, X2, X3 0

II.

Max. Z = 3X1 + 5X2,


s/t
X1 +X2 = 4
X2 + X4 = 6

35 Degeneracy problem
I.

Max. Z = 5X1 + 3X2,


s/t
X1 +X2 2
5X1 +2X2 10

C. G. Patel Institute of Technology, Bardoli


Maliba Campus

Page | 5

3X1 +8X2 12
X1, X2 0.

3X1 + 2X2 + X5 = 12,


X1 , X2 , X3 , X4, X5 0

C. G. Patel Institute of Technology, Bardoli


Maliba Campus

Page | 6