1

Linear Programming
Problems
Assignment

PRACTICE PROBLEMS: LPP

 2

.
Assignement-1 LPP
1. Solve graphically the following L.P. Problems:
(i) Max. Z = 2x1 + 3x2
s.t. x1 + x2  1
3x1 + x2  4
and x1, x2  0.
(ii) Max. Z = 6x1 – 2x2
s.t. 2x1 – x2  2
x1  3
and x1, x2  0
(iii) Max. Z = 3x1 + 2x2
s.t. 2x1 – x2  2
x1 + 2x2  8
and x1, x2  0
(iv) Max. Z = 3x1 + 2x2
s.t. –2x1 + x2  1
x1  2
x1 + x2  3
and x1, x2  0
(v) Max. Z = 5x1 + 3x2
s.t. 3x1 + 5x2  15
5x1 + 2x2  10
and x1, x2  0
(vi) Max. Z = 3x1 + 4x2
s.t. 5x1 + 4x2  200
3x1 + 5x2  150
5x1 + 4x2  100
8x1 + 4x2  100
and x1, x2  0
(vii) Max. Z = 3x1 + 4x2
s.t. x1 – x2  –1
–x1 + x2  0
and x1, x2  0
 3

(viii) Max. Z = 3x1 + 2x

s.t. –2x1 + 3x2  9
–x1 – 5x2  –20
and x1, x2  0
(ix) Max. Z = x1 + 2x
s.t. –2x1 + x2  1
x1 + x2  3
and x1, x2  0
(x) Max. Z = 4x1 + 5x2
s.t. x1 + x2  1
–2x1 + x2  1
4x1 – 2x2  1
and x1, x2  1
2. Solve graphically the following L.P. Problems.
(i) Min. Z = 4x1 + 2x2
s.t. x1 + 2x2  2
3x1 + x2  3
4x1 + 3x2  6
and x1, x2  0
(ii) Min. Z = –x1 + 2x2
s.t. –x1 + 3x2  20
x1 + x2  6
x1 –x2  2
and x1, x2  0
(iii) Mini. Z = 20x1 + 10x2
s.t. x1 + 2x2  40
3x1 + x2  30
4x1 + 3x2  60
and x1, x2  0
(iv) Mini. Z = 2x1 + 3x2
s.t. x1 + x2  4
6x1 + 2x2  8
x1 + 5x2  4
x1  3
 4

x2  3
and x1, x2  0
(v) Min. Z = 2x1 + 3x2
s.t. –x1 + 2x2  4
x1 + x2  6
x1 + 3x2  9
and x1, x2  0
(vi) Min. Z = 2x1 + 3x2
s.t. 5x1 + 10x2  50
x1 + x2  1
x2  4
and x1, x2  0
3. Determines x  0 and y  0, so as to maximize Z = 2x + 3y subject to the constraints:
x  y  30, y  12, x  20, y  3, x – y  0 .
4. Does the following L.P.P. has a feasible solution?
Maximize Z = x1 + x2.
Subject to x1 – x2  0, 3x1 – x2  –3
x1, x2  0
Show with the help of a graph.
5. The postmaster of a local post office wishes to hire extra helpers during the Deepawali season, because of
a large increase in the volume of mail handling and delivery. Because of the limited office space and the
budgetary condition, the number of temporary helpers must not exceed 10. According to the past
experience, men can handle 300 letters and 80 packages per day, on the average, and, women can handle
400 letters and 50 packages per day. The post master believes that the daily volume of extra mail and
packages will be no less than 3,400 and 680 respectively. A man receives Rs. 25 a day and a woman receives
Rs. 22 a day. How many men and women helpers should be hired to keep the pay roll at a minimum?
6. A soft drink plant has two bottling machines A and B. It produces and sells 8 ounce and 16 ounce bottles.
The following data is available
Machine 8 Ounce 16 Ounce
A 100/minute 40/minute
B 60/minute 75/minute
The machines can be run 8 hrs. per day, 5 days per week. Weekly production of the drinks cannot exceed
3,00,000 ounces and the market can absorb 25,000 eight ounce bottles and 7,000 sixteen ounce bottles per
week. Profit on these bottles is 15 paise and 25 paise per bottle respectively. The planner wishes to
maximize his profit subject to all the production and marketing restrictions. Formulate it as a linear
progrmming problem and solve graphically.
 5

7. The ABC Electric Appliance Company produce two products; refrigerators and coolers. Production takes
place in two separate departments. Refrigerators are produced in Department I and coolers produced in
Department II. The company's two products are produced and sold on a weekly basis. The weekly
production cannot exceed 25 refrigerators in Department 1 and 35 coolers Department II, because of the
limited available facilities in of two departments. The company regularly employs a total of workers in the
two departments. A refrigerator requires 2 man of labour, while a cooler requires 1 man-week of labour
refrigerator contributes a profit of Rs, 60 and a cooler contrives a profit of Rs. 40. How many units of
refrigerators and cool should the company produce to realize maximum profit?
8. A farmer has a 100 acre farm. He can sell the tomatoes, lettuce, radishes he can raise. The price he can
obtain is Rs. 1 per kilogen for tomatoes, Rs. 0.75 per head for lettuce and Rs. 2 per kilog for radishes. The
average yield per acre is 2,000 kilogran tomatoes, 3,000 heads of lettuce and 1,000 kilograms of raditis
Fertilizer is available at -Rs. 0.50 per kilogram and the ams required 𝑝: 𝑟 acre is 100 kilograms each for
tomatoes and leta and 50 kilograms for radishes. Labour required for soui cultivation and harvesting per
acre is 5man/ day for tomatoes a radishes and 6man/ day for lettuce. A total of 400men/ day of hibr are
available at Rs. 20 per man/day.
Formulate this problem as a L.P.P. to maximize the farmed total profit.
9. A firm manufactures twc type of products A and B and sells the at a profit of Rs. 2.00 on type A and Rs.
3.00 on type B. Each product is processed on two machines M1 and M2. Type A requires on minute of
processing time on M1 and two minutes on M2, type requires one minute on M1 and one minute on M2. The
machine M1 is available for not more than 6 hours 40 minutes while machine M2 is available for 10 hours
during any working day.
Formulate the problem as L.P.P and find how many product of each type should the firm produce each day
in order to maximum profit.
10. Old hens can be bought for Rs. 2.00 each but young ones cost 5.00 each. The old hens lay 3 eggs per week
and the young one eggs per week. Each egg being worth 30 paise. A hen sot Rs. 1.00 per week to feed. If I
have only Rs. 80.00 to spend for hence how many of each kind should I buy to give a profit of more the Rs.
6.00 per week assuming that I cannot house more than 20 hence solve the L.P.P, graphically.
11. An automobile manufacture makes automobiles and trucks in a factory that is divided into two shops. Shop
A, which performs the basic assembly operation, must work 5 man-days on each truck but only 2 man-das
on each automobile. Shop B, which performs finishing operation, must work 3 man-days for each
automobile or truck that it produces. Because of men and machine limitations, shop A has 180 man-days
per week available while shop B has 135 man-days per week. If the manufactures makes a profit of Rs. 300
on each truck and Rs. 200 on each automobile, how many of each should he produce to maximize his profit?
12. A manufacturer produces two types of models A and B. Each A model requires 4 hours of grinding and 2
hours of polishing whereas each B model requires 2 hours of grinding and 5 hours of polishing. The
manufactures has 2 grinders and 3 polishers. Each grinder works for 40 hours a week and each polisher
works for 60 hours a week. Profit on an A model is Rs. 3.00 and on and B model is Rs. 4.00 Whatever is
produced in a week is sold in the market. How should the manufactures allocate his production capacity to
the two types of models so that he may make the maximum profit in a week.
 6

13. Solve Q. No. 12 when the profit on an A model is Rs. 30 and on a B model is Rs. 40.
14. A firm manufactures 3 products A, B and C. The profits are Rs. 3, Rs. 2 and Rs. 4 respectively. The firm
has 2 machines and below is he required processing times in minutes for each machine on each product.
Products
A B C
Machine M1 4 3 5
M2 2 2 4
Machines M1 and M2 have 2,000 and 2,500 machines minutes respectively. The firm must manufacture 100
A’s, 200 B’s and 50 C’s but no more than 150 A’s.
Set up and L.P.P to maximize profit. Do not solve it.
15. A factory uses three different resources for the manufactures of two different products, 20 units of the
resource A, 12 units of B and 16 units of C being available. 1 unit of the first product requires 2, 2 and 4
units of the respective resources and 1 units of the product requires 4, 2 and 0 units of the respective resource
known that the first product gives a profit of 2 monetary unit and the second 3.
Formulate the linear programming problem. How many of each product should be manufactured for
maximizing the solve it graphically.
16. A pineapple firm produces two products-canned pineapple canned juice. The specific amounts of material,
labour equipment required to produce each product and the available each of these resources are shown in
the table given below:
Canned Juice Canned Pineapple Available Resource
Labour (man-hour) 3 2.2 12.0
Equipment (machine 1 2.3 6.9
hours)
Material (unit) 1 1.4 4.9
Assuming one unit each of canned juice and canned pieces has profit : argins of Rs. 2 and 1 respectively.
Determine product mix that will maximize the profit.
17. Diet Problem. Consider two different types of foodstuffs and F2. Assume that these foodstuffs contain
vitamins V1, V2, V3 respectively. Minimum daily requirement of three vitamins 1 mg. of V1, 50 mg of V1,
100 mg of V2 and 10 mg. of V3 and he food stuff F2 contains 1 mg. of V1, 10 mg. of V2, 100 mg. of V3, Cost
of one unit of foodstuff F1 is Rs. 1.1 that of F2 is Rs. 1.5.
Find the minimum cost diet that would supply the body are the minimum requirements of each vitamin by
graphical method.
18. A company sells two different product A and B. The ……. makes a profit of Rs. 40 and Rs. 30 per unit on
products A and respectively. The products are produced in a common product process and are sold in two
different markets. The product process has a capability of 30,000 man-hours. It takes 3 bound produce one
unit of A and one hour to produce one unit of B market has been surveyed, and company officials feel the
 7

maximum number of unit of A that can be sold is 8,000 and the maximum of B is 12,000 units. Subject to
these limitations, the products can be sold in any convex combination.
Formula the above problem as a L.P.P and solve it by graphical method.
19. Show that the feasible solution x1 = 1, x2 = 0, x3 = 1, and Z = 6 to the system of equations
x1 + x2 + x3 = 2
x1 – x2 + x3 = 2, xj  0
which minimize Z = 2x1 + 3x2 + 4x3 is not basic.
20. Find all the B.F.S. of following system
8x1 + 6x2 + 13x3 + x4 + x5 = 6
9x1 + x2 + 2x3 + 6x4 + 10x5 = 10
21. Mark the feasible region represented by the constraint equations.
x1 + x2  1, 3x1 + x2  3, x1  0, x2  0,
of a linear optimizing function Z = x1 + x2.
1
22. Is x1 = 1, x2  , x3 = x4 = x5 = 0 a basic solution to the following equations
2
1
x1 + 2x2 + x3 + x4 = 2, x1 + 2x2 + x3 + x5 = 2.
2
1
[Hint: x1  1, x2  , x3  x4  x5  0 satisfy the equation and the values of 5 – 2 = 3, variables are zero.
2
The determinant of column vectors-corresponding to variables x1, x2 is
1 2
a1a1  2–20.
1 2
 the vectors a1, a2, are L.D.
Hence the solution in not basic solution].
Answers
1. (i) x1 = 0, x2 = 1, Z = 3 (ii) x1 = 3, x2 = 4, Z = 10
(iii) x1 = 8, x2 = 0, Z = 24 (iv) x1 = 2, x2 = 1, Z = 8
(v) x1 = 1.053, x2 = 2.368, Z = 12.37 (vi) x1 = 30.7, x2 = 11.5, Z = 138.1
(vii) No solution (viii) No solution
(ix) Infinite number of solutions (x) Unbounded solution
2. (i) x1 = 0.6, x2 = 1.2, Z = 4.8
(ii) x1 = 6, x2 = 1.2, Z = –2
(iii) x1 = 6, x2 = 12, Z = 240
(iv) x1 = 8/7, x2 = 4/7, Z = 4
(v) x1 = 1, 2, x2 = 2.6, Z = 10.2
(vi) Infinite number of solutions.
 8

3. x = 18, y = 12, z = 72.4, No. 5. 6 Men and 4 women.

6. If x1 and x2 bottles of 8 and 16 ounces respectively, are produced the L.P.P. is Max. Z = 0.15x1 + 0.25x2
s.t. 8x1 + 16x2  3,00,000,
2x1 + 5x1  4,80,000, 5x1 + 4x2  7,20,000
x1  25,000, x2  7,000 and x1  0, x2  0,
x1  16,80,000/17, x2 = 9,60,000/17, Max. Z = Rs. 4,92,00/17
7. Refrigerators = 12.5, Coolers = 35, Max. profit = Rs. 2150.00.
8. If the farmer sow tomatoes, lettuce and radishes, in x1, x2, x3 acres respectively, then L.P.P. is
Max. Z = 1850x1 + 2080x2 + 1875x3
s.t. x1 + x2 + x3  100, 5x1 + 6x2 + 5x3  400
and x1, x2, x3,  0.
9. L.P.P. Max. Z = 2A + 3B; s.t. A + B  400, 2A + B  600. And A, B  0,
A = 0, B = 400, Z = 1200.
10. Old hens = 0, Young hens = 16, Profit Z = Rs. 8.
11. Trucks = 30, Automobiles = 15 per week.
12. Model A = 2.5, Model B = 35, Profit Rs. 147.5.
13. Model A = 2.5, Model B = 35, Profit = Rs. 1475.
14. Max. Z = 3x1 + 2x2 + 4x3.
Products A, B, C: x1, x2, x3, respectively.
s.t. 4x1 + 3x2 + 5x3  2,000 : 2x1 + 2x2 + 4x3  2,500; 100  A  150; 0  B  200 and 0  C  50.
15. First product = 2 units, second product = 4 units, profit = 16 monetary units.
16. Canned juice = 4, Pineapple juice = 0, Profit = Rs. 8.
17. F1 = 1 unit, F2 = 0 unit. Cost = Rs. 1.
18. If x1 and x2 are the units of products A and B respectively, L.P.P is
Max. Z = 40x1 + 30x2 ; s.t. 3x1 + x2  30,000;
x1  8,000; x1  12,000; and x1, x1  0.
x1  6,000; x2  12,000.
20. (2/3, 0, 0, 2/3, 0), (50/71, 0, 0, 0, 26/71), (0, 26/35, 0, 54/35, 0), (0, 50/59, 0, 0, 54/59), (0, 0, 13/38, 59/38,
0), (0, 0, 25/64, 0, 59/64).
 9

Assignment-2: LPP
1. Write short note on the simplex method.
or
Give computational procedure for simplex method in linear programming.
2. What is meant by L.P.P.? Give a brief description of the problem with illustration. How the same
can be solved graphically.
3. What do you understand by optimization? State clearly a L.P.P. and give an acconut of the simplex
method of solving this problem. Make a list of the type of errors which can be made during simplex
calculations.
4. (a). Let x1 = 2,x2 = 4 and x3 = 1 be a F.S. to the system of equations
2x1 − x2 + 2x3 = 2, x1 + 4x2 = 18,
Reduce the F.S. to a B.F.S.
(b) (1, 2, 3,) is a feasible solution to the system of equations
x1 + x2 + 2x3 = 4, 2x1 − x2 + x3 = 2,
Reduce the given F.S. to a B.F.S.
5. x1 = 1, x2 = 1, x3 = 1, x4 = 0 is a F.S. to the system of equations
x1 + 2x2 + 4x3 + x4 = 7, 2x1 – x2 + 3x3 − 2x4 = 4
Reduce the F.S. to two different B.F. solutions.
6. Solve the following problems by simplex method.
(1) Max Z = 2x1 + 4x2 + x3 + x4
s.t. x1 + 3x3 + x4 ≤ 4
2x1 + x2 ≤ 3
x2 + 4x3 + x4 ≤ 3
x1 , x2 , x3 , x4 ≥ 0
(ii) Max Z = 2x1 + 4x2 + x3
s.t. x1 + 2x2 ≤ 4
2x1 + x2 ≤ 3
x1 + 4x3 ≤ 3
x1 , x2 , x3 , ≥ 0
(iii) Max Z = x1 + x2 + 3
s.t. x1 + 3x2 ≤ 9
2x1 + x2 ≤ 8
3x1 + 4x2 ≥ 12
x1 , x2, ≥ 0.
 10

(iv) Max Z = 2x1 + 4x2

s.t. 2x1 + 3x2 ≤ 48
x1 + 3x2 ≤ 42
x1 + x2 ≤ 21
x1 , x2 ≥ 0.
(v) Max Z = 5x1 + 3x2
s.t. 3x1 + 5x2 ≤ 15

5x1 + 2x2 ≤ 10
x1 + x2 ≤ 0
(vi) Max Z = 3x1 − x2

s.t. 2x1 + x2 ≥ 2
x1 + 3x2 ≤ 3
x2 ≤ 4
x1 , x2 ≥ 0.
(vii) Max Z = 3x1 + 4x2
s.t. x1 + 3x2 ≤ 9
2x1 − x2 ≤ 8
x1 + x2 ≤ 5
x1 , x2 ≥ 0

(viii) Max Z = 7x1 + 5x2

s.t. x1 + 2x2 ≤ 6
4x1 + 3x2 ≤ 12
x1 , x2 ≥ 0.
(ix) Max Z = 4x1 + 10x2
s.t. 2x1 + x2 ≤ 50

2x1 + 5x2 ≤ 100

2x1 + 3 x2 ≤ 90
x1 , x2 ≥ 0.

(x) Max Z = 4x1 + 5x2 + 9x3 + 11x4

 11

s.t. x1 + x2 + x3 + x4 ≤ 15
7x1 + 5x2 + 3x3 − 2x4 ≤ 120
3x1 + 5x2 + 10x3 + 15x4 ≤ 100

x1 , x2 , x3 , x4 ≥ 0.
(xi) Max Z = 2x1 − x2 + x3
s.t. x1 + x2 − 3x3 ≤ 8

4x1 − x2 + x3 ≥ 2
2x1 + 3x2 − x3 ≤ 4
and x1 , x2 , x3 ≥ 0.
(xii) Max Z = 3x1 + 2x2
s.t. 2x1 + x2 ≤ 8
3x1 + 4x2 ≥ 2
x1 , x2 ≥ 0.
7. Solve the following problems by simplex method.
(i) Mini Z = x1 + x2 + 3x3
s.t. 3x1 + 2x2 + x3 ≤ 3
2x1 + x2 + 2x3 ≤ 2

x1 , x2 , x3 ≥ 0.
(ii) Mini Z = 2x1 + 9x2 + x3
s.t. x1 + 4x2 + 2x3 ≥ 5
3x1 + x2 + 2x3 ≥ 4
x1 , x2 , x3 ≥ 0.
(iii) Mini Z = x1 + x2 + x3
s.t. x1 − x4 − 2x6 = 5
x2 + 2x4 − 3x5 + x6 = 3
x3 + 2x4 − 5x5 + 6x6 = 5
xi ≥ 0. (i = 1, 2,…, 6).
(iv) Mini Z = 2x1 + x2
s.t. 3x1 + x2 = 3
4x1 + 3x2 ≥ 6
 12

x1 + 2x2 ≤ 3
x1 , x2 ≥ 0.
(v) Mini Z = 4x1 + 2x2

s.t. 3x1 + x2 ≥ 27,

x1 + 2x2 ≥ 30,
-x1 − x2 ≤ −21
and x1 , x2 ≥ 0.

8. Use two phase simplex method to solve the following L.P.P.

(i) Max. Z = 5x1 + 8x2
s.t. 3x1 + 2x2 ≥ 3

x1 + 4x2 ≥ 4
x1 + x2 ≤ 5
x1 ≥ 0, x2 ≥ 0.

(ii) Max. Z = 3x1 − x2

s.t. 2x1 + x2 ≥ 2
x1 + x2 ≤ 2

x1 ≤ 4
x1 , x2 ≥ 0.
(iii) Max. Z = 3x1 + 2x2 + x3 + 4x4
s.t. 4x1 + 5x2 + x3 − 3x4 = 5
2x1 − 3x2 − 4x3 − 5x4 = 7
x1 + 4x2 + 2.5x3 − 4x4 = 7
9. Solve the following problems by 'Big M' method,
(i) Max. Z = − 2x1 − x2
s.t. 3x1 +x2 = 3
4x1 + 3x2 ≥ 6

x1 + 2x2 ≤ 4
x1 , x2 ≥ 0
[Meerut 95]
 13

(ii) Max. Z = 5x1 + 6x2

s.t. 2x1 + 5x2 ≥ 1500
3x1 + x2 ≥ 1200

x1 , x2 ≥ 0
10. Solve the following L.P.P. by simplex method.
(i) Max. Z = 4x1 + 3x2
s.t. x1 +x2 ≤ 50

x1 + 2x2 ≥ 80
3x1 + 2x2 ≥ 140
and x1 , x2 ≥ 0
11. A company produces two types of leather belts, say type A and B. Belt A is a superior quality and belt B is of
a lower quality, Profits on the two type of belts are 40 and 30 paise per belt respectively. Each belt of type A
requires twice as much as required by a belt of type B. If all belts were of type B, the company could produce
1,000 belts per day. But the supply of leather is sufficient only for 800 belts per day. But A requires a fancy
buckle and only 400 fancy buckles are available for this, per day. For belt of type B, only 700 buckles are
available per day.
How should the company manufacture the two types of belts in order to have maximum over all profit ?
12. A manufacture of leather belts makes three types of belts A, B and
C. Which are processed on three machines M1, M2, and M3. Belt
A requires 2 hours on machine M1 and 3 hours on machine M3. Belt
B requires 3 hours on machine M1, 2 hours on machine M2 and 2 hours on machine M3 and belt C requires 5
hours on machine M2 and 4 hours on machine M3. There are 8 hours of time per day available on machine M1,
10 hours of time per day available on machine M2 and 15 hours of time per day available on machine M3. The
profit gained from belt A is Rs. 3.00 per unit, from belt B is Rs. 5.00 per unit from belt C is Rs. 4.00 per unit.
What should be the daily production of cach type of belts so that the profit is maximum.
13. Two products A and B are processed on three machines M1, M2, and M3. The processed times per unit, machine
availability and profit per unit are as follows:
Machine Processing time (hours) Availabilty (hours)
A B
M1 2 3 1500
M2 3 2 1500
M3 1 1 1000
profit per unit 10 12
Formulate the methematical model, solve it by using the simplex method and also find the number of hours
machine M3 remains unutilised.
 14

14. A manufacturing firm has discontinued production of a certain unprofitable product line. This created
considerable excess production capacity. Management is considering to devote this excess capacity to one or
more of three products, call them products 1, 2 and 3. The available capacity on the machine which might limit
output is summarized in the following table.
Productivity Available time
(hour per unit) (hours per week)
Product →
A B C
Machine type ↓
Milling Machine 8 2 3 250
Lathe 4 3 0 150
Grinder 2 − 1 50
The unit profit would be Rs. 20, 6 and Rs. 8 respectively for products A, B and C. Find how much of each
product the firm should produce in order to maximize profit.
15. Solve the following system of simultaneous linear equations by using simplex method.
(i) x1 + x2 = 1, 2x1 + x2 = 3.
(ii) 3x1 + 2x2 = 4, 4x1 – x2 = 6
(iii) x1 + 2x2 + x3 + x4 = 10
x1 + 2x2 + 3x3 = 15
2x1 + x2 + 5x3 = 20
16. Use simplex method to find the inverse of the following matrix
3 2  3 2 
(i) 1 2  (ii)  4 1
   
17. Find all the optimal B.F. solutions of the following L.P.P..
Max. 6x1 + 2 x2 + 9
s.t. 3x1 + x2 ≤ 6
x1 + 3x2 ≤ 6
x1, x2 ≥ 0.
18. Find all optimal basis feasible solutions of the following L.P.P.
Min. 3x1 + 6x2 +7
s.t. 2x1 + x2 ≥ 3
x1 + 2x2 ≥ 3
x1, x2 ≥ 0.
19. Determine two different B.F. solution of the L.P.P.
Max. Z = 2x1 + 3x2 + x3 + 0.x4 − Μ.x5 − Μ.x6
s.t. 2x1 + 3x2 + 4x3 + x4 = 6
x1+ 2x2 + 2x3 – x5 + x6 = 6
 15

and x1, x2,..., x6, ≥ 0.

20. The constraints of a L.P.P. are as follows:
3x1 + x2 ≥ 8
2x1 + 5x2 ≤ 14
3x1 − x2 ≤ 36
6x1 + x2 ≤ 99
0 ≤ x ≤ 15, x1 ≥ 0.
Its objective function is f (x1 , x2) = 6x1 + x2.
Find graphically, the maximum and minimum values of the function and the corresponding solutions. Also mark
on the graph, the set of feasible solutions at which the value of the objective function is 30.
21. Consider a matrix B = (b1, b2, b3) whose inverse is
2 0 4
B   5 1 6 
1

7 9 3 

Replace the second column of B with a = [1,8, 6], to yield the matrix Ba = (b1,a, b3).
Compute Ba1.
ANSWERS
4. (a) x1 = 26/9, x2 = 34/9, x3 = 0. (b) x1 = 2, x2 = 2, x3 = 0.
5. x1 = 0, x2 = 1/2, x3 = 3/2, x4 = 0 and x1 = 3, x2 = 2, x3 = 0 = x4.
6. (i) x1 = 1, x2 = 1, x3 = 1/2, x4 = 0, Z = 13/2.
(ii) x1 = 2/3, x2 = 5/3, x3 = 1/3, Z = 25/3.
(iii) x1 = 3, x2 = 2, Z = 8.
(iv) x1 = 6, x2 = 12, Z = 60.
(v) x1 = 20/19, x2 = 45/19, Z = 235/19.
(vi) x1 = 3, x2 = 0, Z = 9.
(vii) x1 = 3, x2 = 2, Z = 17.
(viii) x1 = 3, x2 = 0, Z = 21.
(ix) x1 = 0, x2 = 20 or x1 = 75/4, x2 = 25/2, Z = 200
(x) x1 = 50/7, x2 =0, x3 = 55/7, x4 = 0, Z = 695/7.
(xi) Unbounded Solution.
(xii) No. F.S.
7. (i) x1 = 0 = x2 = x3, Z = 0.
(ii) x1 = 0 = x2, x3 = 5/2, Z = 5/2.
(iii) x1 =213/30, x2 = 0 = x3 = x5, x4 = 13/10, x6 =2/5, Z=213/30.
(iv) x1 = 3/5, x2 = 6/5, Z = 12/5.
(v) x1 = 3, x2 = 18, Z = 48.
 16

8. (i) x1 = 0, x2 = 5, Z = 40.
(ii) x1 = 2, x2 = 0,2 = 6.
(iii) Unbounded.
9. (i) x1 = 3 = 3/5, x1 = 6/5, Z = - 12/5.
(ii) x1 = 4500/13, x1 = 2100/13, Z = 2700
10. No feasible solution.
11. 200 of type A, 600 of type B, Max. Profit Rs. 260.
12. A = 89/41, b = 50/41, C = 62/41, Max. Profit Rs. 765/41.
13. A = 300, B = 300 units, 400 hours.
14. A = 0 unit, B = 50 units, C = 50 units per week, Profit Rs. 700.
15. (i) x1 = 2, x2 = − 1.
(ii) 16/11, −2/11
(iii) x1 = 5/2, x2 = 5/2, x3 = 5/2, x4 = 0.
1  2 2  1 1 2 
16. (i) (ii)
4  1 3  11  4 3
17. x1 = 2, x2 = 0, Z = 21
18. x1 = 1, x2 = 1, Z = 16.
 32 26 40 
1 
21. 5 1 6 
49 
 142 344 435
 17

Assignment-3 LPP
Use duality to solve the following L.P. problems.
1. Max. Z = 3x1 + x2 2. Max. Z = x1 – x2
s.t. x1 + x2  1 s.t. 2x1 + x2  2
2x1 + 3x2  2 – x1 – x2  1
and x1, x2  0. and x1, x2  0.
3. Min. Z = 8x1 – 2x2 – 4x3 4. Max. Z = 4x1 + 3x2
s.t. x1 – 4x2 – 2x3  2 s.t. x1  6
x1 + x2 – 3x3  –1 x2  8
–3x1 – x2 + x3  1, x1 + x2  7
x1, x2, x3  0. 3x1 + x2  15
– x2  1
and x1, x2  0.
5. Min. Z = 10x1 + 6x2 + 2x36. Max. Z = 3x1 + 2x2
s.t. – x1 + x2 + x3  1 s.t. 2x1 + x2  5
3x1 + x2 – x3  2 x1 + x2  3
and x1, x2, x3  0. x1, x2  0.
7. Max. Z = 2x1 + x2,
s.t. x1 + 2x2  10, x1 + x2  6, x1 – x2  2
x1 – 2x2  1, x1, x2, x3  0.
8. Consider problem A.
Minimize Z = x1 – 10x2
s.t. x1 – ·5x2  0, x1 – 5x2  –5, x1, x2  0
and problem B.
Maximize Z = –5x2
s.t. x1 + x2  1, – ·5x1 – 5x2  –10, x1, x2  0.
Explain how the solutions of problems A and B are related?
9. Find the dual of the following problem and hence or otherwise solve it.
Min. Z = 6x + 5y + 2z
s.t. x + 3y + 2z  5, 2x + 2y + z  2,
4x – 2y + 3z  –1 x, y, z  0.
10. Apply the principle of duality to solve the following linear programming problem:
Min. Z = 2x1 + 2x2,
s.t. 2x1 + 4x2  1, x1 + 2x2  1,
2x1 + x2  1, x1, x2  0.
 18

11. Use duality theory to solve the following linear programming problem
Min. Z = 4x1 + 3x2 + 6x3
s.t. x1 + x3  2, x2 + x3  5, x1, x2, x3  0.
12. Find the dual of the problem :
Max. Z = 2x1 – x2,
s.t. x1 + x2  10, – 2x1 + x2  2,
4x1 + 3x2  12. x1, x2  0.
Solve the primal problem by simplex method and deduce from it the solution to the dual problem.
13. Find the dual of the problem
Max. Z = –x1 + 2x2 – x3
s.t. 3x1 + x2 – x3  10, –x1 + 4x2 + x3  6
x2 + x3  4, x1, x2, x3  0.
Solve the primal problem bny simplex metod and deduce the solution of the dual problem from the optima
tableau of the primal.
14. Solve the dual of the following problem by simplex method.
Max. Z = 2x1 + 3x2 + 5x3
s.t. x1 + x2 + x3  7, x1 + 2x2 + 2x3  13,
3x1 – x2 + x3  5, x1, x2, x3  0.
15. Consider the problem
Max. Z = 2x1 + 3x2
s.t. 2x1 + 2x2  10, 2x1 + x2  6,
x1 + 2x2  6, x1, x2  0.
(a) Write the complete dual problem from the canonical form of the above primal.
(b) Solve the primal problem and then find the solution to the dual.
16. Solve the following L.P. problem by simplex method.
15
Min. Z = x1 – 3x2
2
s.t. 3x1 – x2 – x3  3
x1 – x2 + x3  2
and x1, x2, x3  0
Write the dual of the above problem. What should be the maximum value of the objective function of the
dual?
17. By means of the duality theory, solve and illustrate geometrically the following L.P.P.
Max. Z = 3x1 + 2x2
s.t. x1 + x2  1, x1 + x2  7
 19

x1 + 2x2  10, x2  3, x1, x2  0.

18. Consider the problem,
Max. Z = 8x1 + 6x2.
s.t. x1 – x2  3/5, x1 – x2  2, x1, x2  0.
Show that both the primal and the dual problem have no feasible solution.
Answers
1. x1 = 1, x2 = 0, Min. Z = 3. 2. No feasible solution.
3. Unbounced solution or no solutiion.
4. x1 = 4, x2 = 3, Max. Z = 25. 5. x1 = 1/4, x2 = 5/4, x3 = 0, Z = 10.
6. x1 = 2, x2 = 1, Z = 8. 8. No. Solution
9. x1 = 0 = x2, x3 = 5/2, Z = 5. 10. x1 = 1/3 = x2, Z = 4/3.
11. x1= 0, x2 = 3, x3 = 2, Z = 21.
12. x1 = 10, x2 = 0, Max. Z = 20;
Dual x1 = 2, x2 = 0 = x3, Mini Z = 20.
13. x1 = 0 = x3, x2 = 4, Max. Z = 8;
Dual x1 = 0 = x2 x3 = 2, Mini. Z = 8.
15. (i) Mini. Z = 10x1 + 6x2 + 6x3
s.t. 2x1 + 2x2 + x3  2, 2x1 + x2 + 2x3  3, x1, x2, x3  0.
(ii) x1 = 2, x2 = 2, Max. Z = 10; Dual x1 = 0, x2 = 1/3, x3, = 4/3, Mini. Z = 10.
16. x1 = 5/4, x2 = 0, x3 = 3/4, Z = 75/8. 16. x1 = 4, x2 = 3, Z = 18.