SAPTHAGIRI COLLEGE OF ENGINEERING, BANGALORE.

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING.

Question Bank

Sem: VI ‘A’ & ‘B’ Subject: Operation Research

MODULE-1 : INTRODUCTION, LINEAR PROGRAMMING -1

1. Explain the following:

i. Origin, nature and impact of OR.
ii. Defining the problem and gathering the data.
2. What is operations research? List and explain the six phases of OR study.
3. Explain the linear programming model.
4. Write the meaning of following terms with respect to a LPP. Give example for each
i. Feasible solution ii. Infeasible solution iii. Feasible region
iv. Optimal solution v. CPF solution. vi. Unbounded solution
vii. Slack variable viii. Surplus variable
5. A retailer deals in two items only, item A and item B. he has $50000 to invest and a space to
store at most 60 pieces. An item A costs him $2500 and B costs $500. A net profit to him on item
A is $500 and item B is $150. If he can sell all the items he purchases, how should he invest his
amount to have maximum profit?
i. Give a mathematical formulation to LPP.
ii. Use graphical method to solve the problem.
6. Formulate a linear programming model for the problem given below. The Apex television
company has to decide on the number of 27 inch and 20 inch sets to be produced at one of its
factories. Market research indicates that at most 40 of the 27 inch sets and 10 of 20 inch sets can
be sold per month. The maximum number of work hours available is 500 per month. A 27 inch
set requires 20 work hours and 20 inch set requires 10 work hours. Each 27 inch set sold
produces a profit of $120 and each 20 inch produces a profit of $80. A wholesaler agreed to
purchase all the television sets produced if the number do not exceed the maxima indicated by
market research.
7. A farmer has to plant two kinds of trees P and Q in a land of 4000 sq. m. area. Each P tree
requires at least 25 sq. m. and Q tree requires at least 40 sq. m. of land. The annual water
requirements of P tree are 30 units and of Q tree is 15 units per tree, while at most 3000 units of
water is available. It is also estimated that the ratio of the number of Q trees to the number of P
6 17
trees should not be less than and should not be more than . The return per tree from P is
19 8
expected to be one and half times as much as from Q tree. Formulate the problem as LP model.
 8. Use the graphical method to solve the following LPP.
Maximize z = 3x1 +5x2
Subject to x1 ≤ 4
2x2 ≤ 12
3x1 + 2x2 ≤ 18 and x1, x2 ≥ 0
9. A person requires minimum 10, 12 and 12 units of chemicals for A, B and C respectively for his
garden. A liquid product contains 5, 2 and 1 units of A, B and C respectively per jar. A dry
product contains 1, 2 and 4 units of A, B and C per jar. If the liquid product sells for Rs. 3 per jar
and dry product sells for Rs. 2 per jar, how many of each should be purchased in order to
minimize the cost and meet requirement.
10. Old hens can be brought at Rs. 2 each and young ones at Rs. 5 each. The old hens lay 3 eggs per
week and the young ones lay 5 eggs per week, each egg being worth 30 paise. A hen (young or
old) costs Rs. 1 per week to feed. You have only Rs. 80 to spend for buying hens. How many of
each kind should you buy to give a profit of more than Rs. 6 per week assuming that you cannot
house more than 20 hens? Formulate the problem as LPP and solve graphically.
11. ABC firm manufactures three products P1, P2 and P3. The profits are Rs. 30, Rs. 20 and Rs. 40
respectively. The firm has two machines M1 and M2 and requires processing time in minutes for
each machine on each product and total machine available minutes on each machine are given
below.

Machine Machine minutes required Total machine

minutes available
P1 P2 P3

M1 4 3 5 2000

M2 2 2 4 2500

The firm must manufacture at least 100 P1’s and 200 P2’s and 50 P3’s but not more than 150 P1’s. Set up
LP model to solve by simplex method.
12. A farmer has 100 acre farm. He can sell all tomatoes, lettuce or radishes he can raise. The price
he can obtain is Rs. 1.0 per kg for tomatoes, Rs. 0.75 a head for lettuce and Rs. 2.0 per kg for
radishes. The average yield per acre is 2000 kg of tomatoes, 3000 heads of lettuce and 1000 kg of
radishes. Fertilizer is available at Rs. 0.5 per kg and the amount required per acre is 100 kg each
for tomatoes and lettuce and 50 kg for radishes. Labor required for sowing, cultivating and
harvesting per acre is 5 man days for tomatoes and radishes and 6 man days for lettuce. A total of
400 man days of labor are available at Rs. 20.0 per man day. Formulate this problem as a linear
programming model to maximize the farmer’s total profit.
13. A company has two bottling plants one located at Bangalore and other located at Mysore. Each
plant produces 3 brands of soft drinks A, B and C. Bangalore plant can produce 1500, 3000 and
2000 bottles of A, B and C in a day respectively while the capacity of Mysore plant is 1500, 1000
and 5000 bottles of A, B and C per day respectively. Market survey indicates that during the
month of April there will be minimum demand of 20000 bottles of A, 40000 of B and 44000 of
C. the operating cost/day for Mysore plant is Rs. 4000 and for Bangalore plant is Rs. 6000. For
how many days should the plant run in April so as to minimize the production cost, while still
meeting the demands?
14. A company produces two types of hats. Each hat of the first type requires twice as much labour
time as the second type. If all hats are of the second type only, the company can produce a total
 of 500 hats a day. The market limits daily sales of first and second types to 150 and 250 hats.
Assuming that the profits per hat are Rs. 8 for type I and Rs. 5 for type II. 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.
15. A firm can produce 3 types of cloth say A, B, and C. Three kinds of wool are required for it say,
red, green and blue wool. One unit length of type A cloth needs two meters of red, 3 meters of
blue wool. One unit length of B requires 3 meters of red, 2 meters of green and 2 meters of blue
wool and one unit length of type C needs 5 meters of green, 4 meters of blue wool. The firm has
only stock of 8 meters of red, 10 meters of green and 15 meters of blue wool. It is assumed that
income obtained from one unit length of type A cloth is Rs. 3, type B cloth is Rs. 5.0 and of type
C is Rs. 4.0. Determine how the firm should use the available materials so as to maximize the
income from finished cloth.
16. Use the graphical method to solve the following LPP.
x2
Maximize z = x1 +
2
Subject to 3x1 + 2x2 ≤ 12,
5x1 ≤ 10,
x1 + x2 ≤ 18,
-x1 + x2 ≥ 4, and x1, x2 ≥ 0
17. Use the graphical method to solve the following LPP.
Maximize z = 10x1 + 20x2
Subject to -x1 + 2x2 ≤ 15,
x1 + x2 ≤ 12,
5x1 + 3x2 ≤ 45, and x1, x2 ≥ 0
18. A manufacture produces three models I, II, III of certain product using raw materials A and B.
the following table gives the data for the problem.

Raw material Requirement per unit Availability

I II III

A 2 3 5 4000

B 4 2 7 6000

Minimum Demand 200 200 150 --

Profit per unit (Rs) 30 20 50 --

Formulate the problem as a linear programming model.

19. A manufacture has 3 machines A, B and C with which he produces 3 different articles P, Q and
R. the different machine time required per article, the amount of time available in any week on
each machine and the estimated profits per article are furnished in the following table. Formulate
the problem as LPP.

Article Machine time(in hrs) Profit per article

 A B C (in Rs.)

P 8 4 5 20

Q 2 3 0 6

R 3 0 1 8

Available 250 150 50 ---

machine hours

20. Using graphical method solve the LPP.

Maximize Z = 5x1 + 4x2
Subject to 6x1 + 4x2 ≤ 24
x1 + 2x2 ≤ 6
-x1 + x2 ≤ 1
x2 ≤ 2, and x1, x2 ≥ 0
21. Use the graphical method to solve the following LPP.
Maximize z = 100x1 + 40x2
Subject to 5x1 + 2x2 ≤ 1000,
3x1 + 2x2 ≤ 900,
x1 + 2x2 ≤ 500, and x1, x2 ≥ 0
22. Use the graphical method to solve the following LPP.
Minimize z = 1.5x1 + 2.5x2
Subject to x1 + 3x2 ≥ 3,
x1 + x2 ≥ 2, and x1, x2 ≥ 0
23. Use graphical method to solve the following LPP.
Zmin = 4x1 + x2
Subject to 3x1 + x2 = 3,
4x1 + 3x2 ≥ 6,
x1 + 2x2 ≤ 3, and x1, x2 ≥ 0
24. Use graphical method to solve the following LPP.
Zmin = 3x1 - 2x2
Subject to -2x1 + x2 ≤ 9,
x1 - 5x2 ≥ -20 and x1, x2 ≥ 0

25. Use graphical method to solve the following LPP.

Zmax = 6x1 + 4x2
Subject to 2x1 + 4x2 ≤ 4,
4x1 + 8x2 ≥ 16 and x1, x2 ≥ 0
26. Use graphical method to solve the following LPP.
Maximize Z = x1 + x2
Subject to x1 + x2 ≤ 1,
-3x1 + x2 ≥ 3 and x1, x2 ≥ 0
27. Use graphical method to solve the following LPP.
Zmax = 3x1 + 2x2
Subject to 5x1 + x2 ≥ 10,
x1 + x2 ≥ 6,
x1 + 4x2 ≥ 12, and x1, x2 ≥ 0

28. Explain the assumptions of linear programming.

MODULE -2 : LINEAR PROGRAMMING -2, SIMPLEX METHOD -1
1. Explain the steps needed to find feasible solution using simplex method.
2. Explain the concept of Tie breaking in simplex method.
OR
Explain the special cases that arise in the use of simplex method.
3. Why is simplex method a better technique than graphical method for most real case? Explain.
4. Explain the concept of degeneracy in simplex method.
5. Define basic solution. Find all the basic solutions of the following system of equations
identifying in each case the basic and non basic variables:
2x1 + x2 + 4x3 =11, 3x1 + x2 + 5x3 = 14
6. Obtain all the basic solutions to the following system of linear equations:
2x1 + 3x2 +4x3 = 10 3x1 + 4x2 + x3 =12
Also classify the solutions into
i. Basic feasible solution
ii. Degenerate basic solution
iii. Non – degenerate basic feasible solution.
7. TOYCO assembles three types of toys – trains, trucks and cars using three operations. The
daily limits on the available times for the three operations are 430, 460 and 420 minutes
respectively. And the revenue per unit of toy train, truck and car are $3, $2 and $5
respectively. The assembly times per train at the three operations are 1, 3 and 1 minute
respectively. The corresponding times per truck and per car are (2, 0, 4) and (1, 2, 0) minutes
(a zero time indicates that the operation is not used). Formulate the problem as LPP and solve
using the simplex method.
8. Solve the following LPP by simplex method.
Maximize z = 2x1 + 2x2
Subject to 5x1 + 3x2 ≤ 8,
2x1 + 4x2 ≤ 8, and x1, x2 ≥ 0.
9. Solve the following LPP using simplex method
Maximize z = 5x1 + 4x2
Subject to 6x1 + 4x2 ≤ 24,
x1 + 2x2 ≤ 6,
-x1 + x2 ≤ 1, x2 ≤ 2, and x1, x2 ≥ 0
10. Solve the following LPP by simplex method.
Maximize z = 3x1 + 2x2
Subject to x1 + x2 ≤ 4,
x1 – x2 ≤ 2, and x1, x2 ≥ 0
 11. Solve the following LPP by simplex method.
Maximize z = 6x1 + 8x2
Subject to 2x1 + 8x2 ≤ 16,
2x1 + 4x2 ≤ 8 and x1, x2 ≥ 0
12. Solve the following LPP by simplex method.
Maximize z = 10x1 + 15x2 + 8x3
Subject to x1 + 2x2 + 2x3 ≤ 200,
2x1 + x2 + x3 ≤ 220,
3x1 + x2 + 2x3 ≤ 180,
x1 ≥10, x2 ≥ 20, x3 ≥ 30 and x1, x2, x3 ≥ 0.
13. Work through the simplex method step by step to solve the following problem:
Minimize z = x1 - 3x2 + 3x3
Subject to 3x1 - x2 + 2x3 ≤ 7,
2x1 + 4x2 ≥ -12,
-4x1 - 3x2 - 8x3 ≤ 10, and x1, x2, x3 ≥ 0.
14. Solve by simplex method.
Maximize Z = 2x1 + 3x2
Subject to x1 ≤ 5,
x2 ≥ 10, and x1, x2 ≥ 0.
15. Solve the problem by simplex method
Maximize Z = 5x1 + 3x2
Subject to x1 + x2 ≤ 2,
5x1 + 2x2 ≤ 10,
3x1 + 8x2 ≤ 12, x1 ≥ 0 and x2 ≥ 0
16. Solve the following LPP by simplex method.
Maximize Z = 3x1 + 2x2 + 5x3
Subject to x1 + 2x2 + x3 ≤ 430,
3x1 + 2x2 ≤ 460,
x1 + 4x2 ≤ 420,
x1, x2, x3 ≥ 0.
17. Explain the two phase technique procedure of solving LPP in simplex method.
18. Solve the following LPP by Big-M method
Maximize z = 4x1 + x2
Subject to 3x1 + x2 = 3
4x1 + 3x2 ≥ 6
x1 + 2x2 ≤ 3 and x1, x2 ≥ 0
19. Using Big – M method solve the following.
Minimize z = 5x1 + 4x2
Subject to 6x1 + 4x2 ≤ 24
x1 + 2x2 ≤ 6
-x1 + x2 ≤ 1
x2 ≤ 2 and x1, x2 ≥ 0
20. Use penalty method to solve the following LPP.
Minimize z = 5x1 + 3x2
Subject to 2x1 + 4x2 ≤ 12
2x1 + 2x2 = 10
5x1 + 2x2 ≥ 10 and x1, x2 ≥ 0
21. Using two phase method solve the following LPP.
Minimize z = 7.5x1 – 3x2
Subject to 3x1 – x2 – x3 ≥ 3
x1 – x2 +x3 ≥ 2 and x1, x2 x3 ≥ 0
22. Using Big – M method solve the LPP.
Maximize z = 2x1 + x2
Subject to 3x1 + x2 = 3
4x1 + 3x2 ≥ 6
x1 + 2x2 ≤ 3 and x1, x2 ≥ 0
23. Solve the following LPP by two phase simplex method.
Maximize z = 3x1 – x2
Subject to 2x1 + x2 ≥ 2
x1 + 3x2 ≤ 2
x2 ≤ 4 and x1, x2 ≥ 0
24. Solve the following LPP by Big – M method.
Maximize z = -2x1 – x2
Subject to 3x1 + x2 = 3
4x1 + 3x2 ≥ 6
x1 + 2x2 ≤ 4 and x1, x2 ≥ 0
25. Food X contains 6 units of vitamin A per gram and 7 units of vitamin B per gram and costs
12 paise per gram. Food Y contains 8 units of vitamin A per gram and 12 units of vitamin B
per gram and costs 20 paise per gram. The daily minimum requirements of vitamin A and
vitamin B are 100 units and 120 units respectively. Find the minimum cost of the product
mix. Formulate the problem and solve using two phase method.
26. Solve the following LPP by two phase simplex method.
Minimize z = 0.4x1 – 0.5x2
Subject to 0.3x1 + 0.1x2 ≤ 2.7
0.5x1 + 0.5x2 = 6
0.6x1 + 0.4x2 ≥ 6
and x1, x2 ≥ 0
27. Using Big – M method solve the LPP.
Maximize z = 6x1 + 4x2
Subject to 2x1 + 3x2 ≤ 30
3x1 + 2x2 ≤ 24
x1 + x2 ≥ 3 and x1, x2 ≥ 0
Find at least two solutions.
28. Using Big- M method, solve the following.
Minimize z = 3x1 + 2x2 + x3
Subject to x1 + x2 = 7,
2x1 + x2 + x3 ≥ 10,
x1, x2, x3 ≥ 0.
29. Solve the following LPP by two phase method
Maximize z = 5x1 + 8x2
Subject to 3x1 + 2x2 ≥ 3
x1 + 4x2 ≥ 4
x1 + x2 ≤ 5 and x1, x2 ≥ 0?

x1 ,x2 ,x3 >= 0.