SAMSKARA IAS ACADEMY

LINEAR PROGRAMMING

1. A manufacturer produces two types of models M1 and M2. Each M1 model requires 4hours of grinding and 2
hours of polishing; whereas each M2 model requires 2 hours of grinding and 5 hours of polishing. The
manufacturer 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 M1 model is ₹3 and on an M2 model is ₹4. Whatever is produced in a week is
sold in the market. How should the manufacturer allocate his production capacity to the two types of models so
that he may make the maximum profit in a week.
2. A firm making castings uses electric furnace to melt iron with the following specifications:
Minimum Maximum
Carbon 3.20% 3.40%
Silicon 2.25% 2.35%
Specifications and costs of various raw materials used for this purpose are given below:
Material Carbon % Silicon % Cost (₹)
Steel scrap 0.4 0.15 850/ tonne
Cast iron scrap 3.80 2.40 900/ tonne
Remelt from foundry 3.50 2.30 500/ tonne
If the total charge of iron metal required is 4 tonnes, find the weight in kg of each raw material that must be used
in the optimal mix at minimum cost.
3. A firm manufactures two items. It purchases castings which are then machined, bored and polished. Casting for
items A and B cost ₹3 and ₹4 each and are sold at ₹6 and ₹7 each respectively. Running costs of these machines
are ₹20, ₹14 and ₹17.50 per hour respectively. Formulate the problem so that the product mix maximizes the
profit? Capacities of the machines are
furl A furlB
Machining capacity 25 per hr. 40 per hr.
Boring capacity 28 per hr. 35 per hr.
Polishing capacity 35 per hr. 25 per hr.
4. A firm manufactures 3 products A, Band C. The profits are ₹3, ₹2 and ₹4 respectively. The firm has two
machines M1 and M2 and below is the required processing time in minutes for each machine on each product.
Product

A B C

M1 4 3 5
Machine M2 2 2 4

Machines M1 and M2 have 2000 and 2500 machine-minutes respectively. The firm must manufacture 100 A’s,
200 B's and 50 C's but not more than 150 A's. Set up an L.P.P. to maximize profit.
5. Three products are processed through three different operations. The time (in minutes) required per unit of each
product, the daily capacity of the operations (in minutes per day) and the profit per unit sold for each product (in
rupees) are as follows:
Time per unit
Operation Operation capacity
Product I Product II Product III
1 3 4 3 42
2 5 0 3 45
3 3 6 2 41
Profit ₹ 3 2 1

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 1
 SAMSKARA IAS ACADEMY
The zero time indicates that the product does not require the given operation. The problem is to determine the
optimum daily production for three products that maximize the profit. Formulate this production planning
problem as a linear programming problem assuming that all units produced are sold.

6. An aeroplane can carry a maximum of 200 passengers. A profit of ₹400 is made on each first class ticket and a
profit of ₹300 is made on each economy class ticket. The airline 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. How
many tickets of each class must be sold in order to maximize profit for the airline? Formulate the problem as an
L.P. model.
7. A firm manufactures headache pills in two sizes A and B. Size A contains 2 grains of asprin, 5 grains of
bicarbonate and 1 grain of codeine. Size B contains 1 grain of asprin, 8 grains of bicarbonate and 6 grains of
codeine. It is found by users that it requires at least 12 grains of aspirin, 74 grains of bicarbonate and 24 grains
of codeine for providing immediate effect. It is required to determine the least number of pills a patient should
take to get immediate relief. Formulate the problem as a standard L.P.P.
8. Consider the following problem faced by a production planner in a soft-drink plant. He has two bottling
machines A and B. A is designed for 8-ounce bottles and B for 16-ounce bottles. However, each be can used on
both types with some loss of efficiency. The following data is available:
Machine 8 – ounce bottles 16– ounce bottles
A 100/minute 40/ minute
B 60/ minute 75/ minute
The machines can be run 8 hour per day, 5 days per week. Profit on a 8-ounce bottle is 15 paise and on 16
ounce bottles is 25 paise. Weekly production of the drink cannot exceed 300,000 ounces and the market can
absorb 25,000 8-ounce bottles and 7,000 16-ounce bottles per week. The planner wishes to maximise his profit
subject, of course, to all the production and marketing restrictions. Formulate this as a L.P.P.
9. A dairy feed company may purchase and mix one or more of three types of grains containing different amounts
of nutritional elements. The data is given in the table below. The production manager specifies that any feed mix
for his live stock must meet at least minimum nutritional requirements and seeks the least costly among all three
mixes.
Item One unit weight of Minimum requirement
Grain 1 Grain 2 Grain 3
A 2 3 7 1,250
Nutritional B 1 1 0 250
ingredients C 5 3 0 900
D 6 25 1 232.5
Cost per weight of 41 35 96
Formulate the problem as a L.P. model.
10. A firm produces an alloy with the following specifications:
(i) specific gravity ≤ 0.97; (ii) chromium content ≥ 15%; (iii) melting temperature ≥ 494°C
The alloy requires three raw materials A, B and C whose properties are as follows:
Property Properties of raw material.
A B C
Sp. Gravity 9.40 1.00 1.05
Chromium 10% 15% 17%
Melting pt. 470°C 500°C 520°C
Find the values of A, B, C to be used to make 1 tonne of alloy of desired properties, keeping the raw material
costs at the minimum When they are ₹105/tonne for A, ₹245/tonne for B and ₹165/tonne for C. Formulate an
L.P. model for the problem.

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 2
 SAMSKARA IAS ACADEMY
11. Find the maximum value of Z == 2x + 3y subject to the constraints: x + y ≤ 30, y ≥ 3,0 ≤ y ≥ 12,x – y ≥ 0, and 0
≤ x ≤ 20.
12. A company manufactures two types of cloth, using three different colours of wool. One yard length of type a
cloth requires 4 oz of red wool, 50z of green wool and 3 oz of yellow wool. One yard length of type B cloth
requires 5 oz of red wool, 2 oz of green wool and 8 oz of yellow wool. The wool available for manufacturer is
1000 oz of red wool, 1000 oz of green wool and 1200 oz of yellow wool. The manufacturer can make a profit of
₹5 on one yard of type A cloth and ₹3 on one yard of type B cloth. Find the best combination of the quantities of
type A and type B cloth which gives him maximum profit by solving the L.P.P. graphically.
13. A company making cold drinks has two bottling plants located at towns T1 and T2. Each plant produces three
drinks A, Band C and their production capacity per day is shown below:
Cold drinks Plant at
T1 T2
A 6000 2000
B 1000 2500
C 3000 3000
The marketing department of the company forecasts a demand of 80,000 bottles of A, 22,000 bottles of B and
40,000 bottles of C during the month of June. The operating costs per day of plants at T 1 and T2 are ₹6,000 and
₹ 4,000 respectively. Find (graphically) the number of days for which each plant must be run in June so as to
minimize the operating costs while meeting the market demand.
14. A firm uses milling machines, grinding machines and lathes to produce two motor parts. The machining times
required for each part, the machining times available on different machines and the profit on each motor part are
given below:
Type· of machine Machining time reqd. for the motor part (mts) Max. time available
I II per week (minutes)
Milling machines 10 4 2000
Grinding machines 3 2 900
Lathes 6 12 3000
Profit / unit (₹) 100 40
Determine the number of parts I and II to be manufactured per week to maximize the profit.
15. Using graphical method, solve the following L.P.P.:
Maximize subject to Z = 2x1 + 3x2 …(i)
x1 – x2 ≤ 2 …(ii)
x1 + x2 ≥ 4 …(iii)
x1, x2 ≥ 0. …(iv)
16. Solve graphically the following L.P.P.:
Maximize subject to Z = 4x1 + 3x2 …(i)
x1 – x2 ≤ - 1 …(ii)
– x1 + x2 ≤ 0 …(iii)
x1, x2 ≥ 0. …(iv)
17. Max. Z = 3x1 + 5x2
subject to x1 + 2x2 ≤ 200, x1 + x2 ≤ 150, x1 ≤ 60, x1, x2 ≥ 0
18. Max. Z = 5x1 + 7x2
subject to x1 + x2 ≤ 4, 5x1 + 8x2 ≤ 24, 10x1 + 7x2 ≤ 35, and x1, x2 ≥ 0
19. Max. Z = 20x1 + 30x2
subject to x1 + 2x2 ≤ 40, 3x1 + x2 ≥ 30, 4x1 + 3x2 ≥ 60, x1, x2 ≥ 0
20. Max. Z = 3x1 + 5x2 subject to x1 + 2x2 ≤ 2000, x1 + x2 ≤ 1500, x2 ≤ 600, and x1 ≥ 0, x2 ≥ 0.
21. A firm manufactures two products A and B on which the profits earned per unit are ₹3 and ₹4 respectively. Each
product is processed on two machines M1 and M2. Product A requires one minute of processing time on M1 and
2 minutes onM2 while B requires one minute on M1 and one minute onM2. Machine M1 is available for not more

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 3
 SAMSKARA IAS ACADEMY

than 7 hours and 30 minutes while M2 is available for 10 hours during any working day. Find the number of
units of products A and B to be manufactured to get maximum profit.
22. Two spare parts X and Yare. to be produced in a batch. Each one has to go through two processes A and B. The
time required in hours per unit and total time available are given below:
X Y Total hours available
Process A 3 4 24
Process B 9 4 36
Profits per unit of X and Y are ₹5 and ₹6 respectively. Find how many number of spare parts of X and Yare to
be produced in this batch to maximize the profit. (Each batch is complete in all respects and one cannot produce
fractional units and stop the batch).
23. A manufacturer has two products I and II both of which are made in steps by machines A and B. The process
times per hundred for the two products on the two machines are:
Product M/c. A M/c. B
I 4 hrs. 5 hrs.
II 5 hrs. 2 hrs.
Set-up times are negligible. For the coming period machine A has 100 hrs. and B has 80 hrs. The contribution
for product I is ₹10 per 100 units and for product II is ₹5 per 100 units. The manufacturer is in a market which
can absorb both products as much as he can produce for the immediate period ahead. Determine graphically,
how much of products I and It, he should produce to maximize his contribution.
24. A production manager wants to determine the quantity to be produced per month of products A and B
manufactured by his firm. The data on resources required and availability of resources are given below:
Resources Requirements Available per month
Product A Product B
Raw material (kg.) 60 120 12000
Machine hrs/piece 8 5 600
Assembly man hrs. 3 4 500
Sale price/piece ₹30 ₹40
Formulate the problem as a standard L.P.P. Find product mix that would give maximum profit by graphical
technique.
25. A pineapple firm produces two products: canned pineapple and canned juice. The specific amounts of material,
labour and equipment required to produce each product and the availability of each of these resources are shown
in the table given below:
Canned Juice Pineapple Available Resources
Labour (man hrs) 3 2.0 12.0
Equipment (m/c hrs) 1 2.3 6.9
Material (unit) 1 1.4 4.9
Assuming one unit each of canned juice and canned pineapple has profit margins of ₹2 anti ₹1 respectively.
Formulate this as L.P. problem and solve it graphically. Solve the following L.P. problems graphically:
26. Maximize Z = 6x + 4y subject to 2x + y ≥ 1, 3x + 4y ≥ 1.5 and x, y ≥ 0.
27. Max. Z = 8x1 + 12x2 subject to 60x1 + 30x2 ≥ 240, 30x1 + 60x2 ≥ 300, 30x1 + 180x2 ≥ 540. and x1, x2 ≥ 0
28. G.J. Breweries Ltd. have two bottling plants one located at 'G' and other at 'J'. Each plant produces three drinks:
whiskey, beer and brandy. The number of bottles produced per day are as follows:
Drink Plant at G Plant at J
Whiskey 1500 1500
Beer 3000 1000
Brandy 2000 5000
A market survey indicates that during the month of July, there will be a demand of 20,000 bottles of whiskey,
40,000 bottles of beer and 44,000 bottles of brandy. The operating cost per day for plants at G and J are ₹ 600

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 4
 SAMSKARA IAS ACADEMY
and ₹400. For how many days each plant be run in July so as to minimize the production cost, while still
meeting the market demand. Solve graphically.
29. Convert Max. Z = 3x1 + 5x2 + 7x3 subject to 6x1 + 4x2 ≤ 5, 3x1 + 2x2 + 3x3 ≥ 11, 4x1 + 3x3 ≤ 2, x1, x2 ≥ 0
30. Express the following problem in the standard form:
Minimize Z = 3x1 + 4x2 subject to 2x1 + x2 – 3x2 = – 4, 3x1 + 5x2 + x4 = 10, x1 – 4x2 = 12, x1, x2, x4 ≥ 0.
31. Find all the basic solutions of the following system of equations identifying in each case the basic non-basic
variables: 2x1 + x2 + 4x3 = 11, 3x1 + x2 + 5x3 = 14.
32. Find an optimal solution to the following L.P.P. by computing all basic solution and then finding one that
maximizes the objective function:
2x1 + 3x2 – x3 + 4x4 = 8, x1 – 2x2 + 6x3 – 7x4 = – 3, x1, x2, x4 ≥ 0, Max. Z = 2x1 + 3x2 + 4x3 + 7x4.
33. Reduce the following problem to the standard form:
Determine x1 ≥ 0, x2 ≥ 0, x3 ≥ 0 so as to
Maximize Z = 3x1 + 5x2 + 8 8x3
34. Express the following L.P.P. in the standard form
Maximize Z = 3x1 + 2x2 + 5x3
Subject to – 5x1 + 2x2 ≤ 5, 2x1 + 3x2 + 4x3 ≥ 7, 2x1 + 5x3 ≤ 7, 2x1 + 5x3 ≤ 3, x1, x2, x3 ≥ 0.
35. Convert the following L.P.P. in the standard form
Maximize Z = 3x1 – 2x2 + 4x3
Subject to x1 + 2x2, x3 ≤ 8, 2x1 – x2 + x3 ≥ 2, 4x1 – 2x2 – 3x3 = – 6, x1, x2 ≥ 0.
36. Obtain all the basic solutions to the following system of linear equation: x1 + 2x2 + x3 = 4, 2x1 + x2 + 5x3 = 5.
37. Show that the following system of linear equation has two degenerate feasible basic solution and the non-
degenerate basic solution is not feasible: 2x1 + x2 – x3 = 2, 3x1 + 2x2 + x3 = 3.
38. Find the basic solution of the following problem:
39. Express the following L.P.P. in the standard form
Maximize Z = x1 + 3x2 + 3x3
Subject to x1 + 2x2 + 3x3 = 4, 2x1 + 3x2 + 5x3 = 7 and x1 ≥ 0, x2 ≥ 0, x3 ≥ 0. Which of the basic solutions are
(a) non-degenerate basic feasible, (b) optimal basic feasible?
40. Using simplex method
Maximize Z = 5x1 + 3x2
Subject to x1 + x2 ≤ 2, 5x1 + 2x2 + x3 ≤ 10, 3x1 + 8x2 ≤ 12, x1, x2 ≥ 0.
41. A firm produces three products which are processed on three machines. The relevant data is given below:
Machine Time per unit (minutes) Machine capacity
Product A Product B Product C (minutes/day)
M1 2 3 2 440
M2 4 - 3 470
M3 2 5 - 430
The profit per unit for products A, B and C is ₹4, ₹3 and ₹6 respectively. Determine the daily number of units to
be manufactured for each product. Assume that all the units produced are consumed in the market.
42. Solve the following L.P.P. by simplex method:
Maximize Z = x1 + 3x2 + 3x3
Subject to 3x1 – x2 + 2x3 ≤ 7, 2x1 + 4x2 ≥ – 12, – 4x1 + 3x2 + 8x3 ≤ 10, x1 + x2 , x3 ≥ 0.
43. Maximize Z = 107x1 + x2 + 2x3
1
Subject to constraints: 14x1 + x2 – 6x3 + 3x4 = 7, 16x1 + x2 – 6x3 ≤ 0, x1, x2, x3, x4 ≥ 0.
2
Using simplex method, solve the following L.P.P.:
44. Maximize Z = x1 + 3x2,
subject to x1 + 2x2≤ 10, 0 ≤ x1 ≤ 5, 0 ≤ x2 ≤ 4.
45. Maximize Z = 4x1 + 10x2,
subject to 2x1 + 2x2≤ 50, 2x1 + 5x2 ≤ 100, 2x1 + 3x2 ≤ 90, x1, x2 ≥ 0.
46. Maximize Z = 4x1 + 5x2,

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 5
 SAMSKARA IAS ACADEMY
subject to x1 – 2x2≤ 2, 2x1 + x2 ≤ 6, x1 + 2x2 ≤ 5, - x1 + x2 ≤ 2, x1, x2 ≥ 0.
47. Maximize Z = 10x1 + x2 + 2x3
subject to x1 + x2 – 2x3 ≤ 10, 4x1 + x2 + x3 ≤ 20, x1, x2, x3 ≥ 0.
48. Maximize Z = 3x1 + 2x2 + 5x3, subject to x1 + 2x2 + x3 ≤ 430, 3x1 + 2x3 ≤ 460, x1 + 4x2 ≤ 420, x1, x2, x3 ≥ 0.
49. Maximize Z = 3x1 + 5x2 + 4x3
subject to 2x1 + 3x2≤ 8, 2x2 + 5x3 ≤ 10, 3x1 + 2x2 + 4x3 ≤ 15, x1, x2 , x3 ≥ 0.
50. Maximize Z = x1 – 3x2 + 2x3
subject to 3x1 – x2 + 2x3 ≤ 7, – 2x1 + 4x2 ≤ 12, - 4x1 + 3x2 + 8x3 ≤ 10, x1, x2 , x3 ≥ 0.
51. Maximize Z = 4x1 + 3x2 + 4x3 + 6x4
subject to 2x1 + 3x2≤ 8, 2x2 + 5x3 ≤ 10, 3x1 + 2x2 + 4x3 ≤ 15, x1, x2 , x3 ≥ 0.
52. Maximize Z = 4x1 + 3x2 + 4x3 + 6x4
subject to x1 + 2x2 + 2x3 + 4x4 ≤ 80, 2x1 + 2x3 + x4 ≤ 60, 3x1 + 3x2 + x3 + x4 ≤ 80, x1, x2 , x3, x4 ≥ 0.
53. A firm produces products A and B and sells them at a profit of ₹2 and ₹3 each respectively. Each product is
processed on machines G and H. Product A requires 1 minute on G and 2 minutes on H whereas product B
requires 1 minute on each of the machines. Machine G is not available for more than 6 hrs. 40 min/day whereas
the time constraint for machine H is 10 hrs. Solve this problem via 'simplex method for maximizing the profit.
54. A company makes two types of products. Each product of the first type requires twice as much labour time as
the second type. If all products are of second type only, the company can produce a total of 500 units a day. The
market limits daily sales of the first and the second type to 150 and 250 units respectively. Assuming that the
profits per unit are ₹8 for type I and ₹5 for type II, determine the number of units of each type to be produced to
maximize profit?
55. The owner of a dairy is trying to determine the correct blend of two types of feed, Both contain various
percentages of four essential ingredients. With the following data determine the least cost blend?
Ingredient % per kg of feed Min requirement in leg.
Feed 1 Feed 2
1 40 20 4
2 10 30 2
3 20 40 3
4 30 10 6
Cost (₹/kg) 5 3
56. A manufacturing firm has discontinued production of a certain unprofitable product line. This created
considerable excess production capacity. Management is considering to devote their excess capacity to one or
more of three product 1, 2, and 3. The available capacity on machines and the number of machine-hours
required for each unit of the respective product, is given below:
Machine Type Available Time Productivity (hrs / unit)
(hrs/week) Product 1 Product 2 Product 3
Milling machine 250 8 2 3
Lathe 150 4 3 0
Grinder 50 2 - 1
The unit profit would be ₹20, ₹6 and ₹8 respectively for products 1,2 and 3. Find how much of each product the
firm should produce in order to maximize profit.
57. The following table gives the various vitamin contents of three types of food and daily requirements of vitamins
alongwith cost per unit. Find the combination of food for minimum cost.
Vitamin (mg) Food F Food G Food H Minimum daily
requirement (mg)
A 1 1 10 1
C 100 10 10 50
D 10 100 10 10
Cost/unit (₹) 10 15 5

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 6
 SAMSKARA IAS ACADEMY

58. A farmer has 1,000 acres of land on which he can grow corn, wheat or soyabeans. Each acre of corn costs ₹100
for preparation, requires 7 man-days of work and yields a profit of ₹30. An acre of wheat costs ₹120 to prepare,
requires 10 man-days of work and yields a profit of ₹40. An acre of soyabeans costs ₹70 to prepare, requires 8
man- days of work and yields a profit of ₹20. If the farmer has ₹100,000 for preparation and can count on 8,000
man-days of work, how many acres should be allocated to each crop to maximize profits?
59. Maximize Z = 2x1 + x2
subject to 3x1 + x2 = 3, 4x1 + 3x2 ≥ 6, x1 + 2x2 ≤ 3, x1, x2 ≥ 0.
60. Maximize Z = 3x1 + 2x2
subject to the constraints 2x1 + x2 ≤ 2, 3x1 + 4x2 ≥ 12, x1, x2 ≥ 0.
61. Use two-phase method to
Maximize Z = 7.5x1 + 3x2
subject to the constraints 3x1 – x2 – x3 ≥ 3, x1 – x2 – x3 ≥ 2, x1, x2, x3 ≥ 0. Phase I. Step 1. Express the problem in
standard form.
62. Maximize Z = 5x1 + 3x2
subject to x1 + x2 ≤ 2, 5x1 + 2x2 ≤ 10, 3x1 + 8x2 ≤ 12; x1, x2 ≥ 0.
63. Maximize Z = 3x1 + 2x2 + 3x3
subject to: 2x1 + x2 + x3 ≤ 2, 3x1 + 4x2 + 2x3 ≥ 8, x1, x2, x3 ≥ 0.
64. Maximize Z = 2x1 + x2 + 3x3
subject to: x1 + x2 + 2x3 ≤ 5, 2x1 + 3x2 + 4x3 = 12, x1, x2, x3 ≥ 0.
65. Maximize Z = 8x2
subject to: x1 – x2 ≥ 0, 2x1 + 3x2 ≤ – 6, x1, x2 unrestricted.
66. Maximize Z = 5x1 – 2x2 + 3x3
subject to: 2x1 + 2x2 – x3 ≥ 2, 3x1 – 4x2 ≤ 3, x2 + 3x3 ≤ 5, x1, x2, x3 ≥ 0.
67. Maximize Z = x1 + 2x2 + 3x2 – x4
subject to: x1 + 2x2 + x3 = 12, 2x1 + x2 + 5x3 = 20, x1 + 2x2 + x3 + x4 = 10, x1, x2, x3, x4 ≥ 0.
68. Maximize Z = x1 + x2
subject to: 2x1 + x2 ≥ 4, x1 + 7x2 ≥ 7, x1, x2, ≥ 0.
69. Maximize Z = x1 + x2
subject to: 2x1 + x2 ≤ 1, x1 + 4x2 ≥ 6, x1, x2, ≥ 0.
70. Maximize Z = 5x1 – 4x2 + 3x3
subject to: 2x1 + 2x2 – x3 ≥ 2, 3x1 – 2x2 ≤ 3, x2 + x3 ≤ 5, x1, x2, x3 ≥ 0.
71. Maximize Z = 9x1 + 3x2
subject to: 4x1 + x2 ≤ 8, 2x1 + x2 ≤ 4, x1, x2, ≥ 0.
72. Maximize Z = 5x1 – 4x2 + 3x3
subject to: 2x1 + 2x2 – 6x3 = 20, 6x1 + 5x2 + 10x3 ≤ 76, 8x1 – 3x2 + 6x3 ≤ 50, x1, x2, x3 ≥ 0.
73. Maximize Z = 2x1 + 3x2 + 10x3
subject to: x1 + 2x3 = 0, x2 + x3 = 1, x1, x2, x3 ≥ 0.
74. Write the dual of the following L.P.P
Maximize Z = 3x1 – 2x2 + 4x3
subject to: 3x1+5x2–4x3≥7, 6x1+2x2+3x3 ≥ 4,7x1 – x2 – x3 ≤ 10, x1 – 2x2 + 5x3 ≥ 3, 4x1 + 7x2 – 2x3 ≥ 2 x1, x2, x3 ≥ 0.
75. Construct the dual of the L.P.P.:
Maximize Z = 4x1 + 9x2 + 2x3
subject to: 2x1 + 3x2 + 2x3 ≤ 7, 3x1 – 2x2 +4x3 = 5, x1, x2, x3 ≥ 0.
76. Maximize Z = 10x1 + 13x2 + 19x3
subject to: 6x1 + 5x2 + 3x3 ≤ 26, 4x1 + 2x2 +5x3 ≤ 7, x1, x2, x3 ≥ 0.
77. Maximize Z = 2x1 + 4x2 + 3x3
subject to: 3x1 + 4x2 + x3 ≥ 11, – 2x1 – 2x2 + 3x3 ≤ – 7, x1 – 2x2 – 3x3 ≤ – 1, 3x1 + 2x2 + 2x3 ≥ 5, x1, x2, x3 ≥ 0.
78. Maximize Z = 3x1 + 16x2 + 7x3
subject to: x1 – x2 + x3 ≥ 3, – 3x1 + 2x3 ≤ 1, 2x1 + x2 – x3 = 4, x1, x2, x3 ≥ 0.

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 7
 SAMSKARA IAS ACADEMY

79. Maximize Z = x1 – 3x2 + x3

subject to: 2x1 – 3x2 + x3 ≤ 5, 4x1 – 2x2 ≥ 9, – 8x1 + 4x2 + 3x3 = 8, x1, x2 ≥ 0 and x3 is unrestricted.
80. Obtain the dual problem of the following L.P.P.
Maximize f(x) = 2x1 + 5x2 + 6x3
subject to: 5x1 + 6x2 – x3 ≤ 3, – 2x1 + x2 + 4x3 ≤ 4, x1 – 5x2 + 3x3 ≤ 1, – 3x1 – 3x2 + 7x3 ≤ 5, x1, x2, x3 ≥ 0. Also
verify that the dual of the dual problem is the primal problem.
81. Construct the dual of the following problem and solve both the primal and the dual:
Maximize Z = 2x1 + x2
subject to: – x1 + 2x2 ≤ 2 x1 + x2 ≤ 4, x1 ≤ 3, x1, x2 ≥ 0.
82. Using duality solve the following problem:
Maximize Z = 0.7x1 + 0.5x2
subject to: x1 ≥ 4, x2 ≥ 6, x1 + 2x2 ≥ 20, 2x1 + x2 ≥ 18, x1, x2 ≥ 0.
83. Maximize Z = 2x1 + 9x2 + 2x3
subject to: x1 + 4x2 + 2x3 ≥ 5, 3x1 + x2 + 2x3 ≥ 4 and x1, x2 ≥ 0.
84. Maximize Z = 2x1 + x2
subject to: x1 + 2x2 ≤ 10, x1 + x2 ≤ 6, x1 – x2 ≤ 2, x1 – 2x2 ≤ 1, x1, x2 ≥ 0.
85. Maximize Z = 3x1 + 2x2
subject to: x1 + x2 ≥ 1, x1 + x2 ≤ 7, x1 + 2x2 ≤ 10, x2 ≤ 3, x1, x2 ≥ 0.
86. Maximize Z = 3x1 + 2x2 + 5x3
subject to: x1 + 2x2 + x3 ≤ 430, 3x1 + 2x2 +2x3 ≤ 460, x1 + 4x2 ≤ 420, x1, x2, x3 ≥ 0.
87. Using dual simplex method:
Maximize Z = – 3x1 – 2x2
subject to: x1 + 3x2 ≥ 1, x1 + x2 ≤ 7, x1 + 2x2 ≥ 10, x2 ≥ 3, x1 ≥ 0, x2 ≥ 0.
88. Using dual simplex method, solve the following problem:
Maximize Z = 2x1 + 2x2 + 4x3
subject to: 2x1 + 3x2 + 5x3 ≥ 2, 3x1 + x2 + 7x3 ≤ 3, x1 + 4x2 + 6x3 ≤ 5, x1, x2, x3 ≥ 0.
89. Maximize Z = – 3x1 – x2
subject to: x1 + x2 ≥ 1, 2x1 + 3x2 ≥ 2; x1, x2 ≥ 0.
90. Maximize Z = 2x1 + x2
subject to: 3x1 + x2 ≥ 3, 4x1 + 3x2 ≥ 6, x1 + 2x2 ≤ 3, x1, x2 ≥ 0.
91. Maximize Z = x1 + 2x2 + 3x3
subject to: 2x1 – x2 + x3 ≥ 4, x1 + x2 + 2x3 ≤ 8, x2 – x3 ≥ 2; x1, x2, x3 ≥ 0.
92. Maximize Z = x1 + 2x2 + x3 + 4x4
subject to: 2x1 + 4x2 + 5x3 + x4 ≥ 10, 3x1 – 2x2 + 7x3 – 2x4 ≥ 2, 5x1 + 2x2 + x3 + 6x4 ≥ 15, x1, x2, x3, x4 ≥ 0.
93. Solve the following transportation problem:
Destination
A B C D
I 21 16 25 13 11
Source II 17 18 14 23 13 Availability
II 32 27 18 41 19
Requirement 6 10 12 15 43

94. A company has three cement factories located in cities 1, 2, 3 which supply cement to four projects located in
towns 1, 2, 3, 4. Each plant can supply 6, 1, 10 truck loads of cement daily respectively and the daily cement
requirements of the projects are respectively 7, 5, 3, 2 truck loads. The transportation costs per truck load of
cement (in hundreds of rupees) from each plant to each project site are as follows:

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 8
 SAMSKARA IAS ACADEMY

Project sites
1 2 3 4
1 2 3 4 5
Factories
2 1 0 6 1
3 5 8 15 9
Determine the optimal distribution for the company so as to minimize the total transportation cost.
95. Solve the following transportation problem:
To
9 12 9 6 9 10 5
7 3 7 7 5 5 6
Form 6 5 9 11 3 11 2
6 8 11 2 2 10 9
4 4 6 2 4 2 22
96. Obtain an initial basic feasible solution to the following transportation problem:
To
D E F G
A 11 13 17 14 250
Form B 16 18 14 10 300
C 21 24 13 10 400
200 225 275 250
97. Solve the following transportation problem:
Suppliers A B C Available
Consumers
I 6 8 4 14
II 4 9 8 12
II 1 2 6 5
Required 6 10 15 31
98. Consider four bases of operations Bi and three targets Tj. The tons of bombs per aircraft from any base that can
be delivered to any target are given in the following table:
Tj
1 2 3
Bi
1 8 6 5
2 6 6 6
3 10 8 4
4 8 6 4
The daily sortie capability of each of the four bases is 150 sorties per day. The daily requirement in sorties over
each target is 200. Find the allocation of sorties from each base to each target which maximizes the total,
tonnage over all the three targets.
99. A company has factories F1, F2, F3 which supply warehouses at W1, W2 and W3. Weekly factory capacities,
weekly warehouse requirements and unit shipping costs. (in rupees) are as follows:
Warehouses
Factories Supply
W1 W2 W3
F1 16 20 12 200
F2 14 8 18 160
F3 26 24 16 90
Demand 180 120 150 450
Determine the optimal distribution for this company to minimize shipping costs,
100. A company is spending ₹1,000on transportation of its units from. plants to four distribution centres, The
supply and demand of units, with unit cost of transportation are given below:

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 9
 SAMSKARA IAS ACADEMY

Distribution centres
Plant Supply
D1 D2 D3 D4
P1 19 30 50 12 7
P2 70 30 40 60 10
P3 40 10 60 20 18
Requirements 5 8 7 15
What can be the maximum saving by optimal scheduling
101. A departmental store wishes to stock the following quantities of a popular product in three types of
containers
Container type : 1 2 3
Quantity: 170 200 180
Tenders are submitted by four dealers who undertake to supply not more than the quantities shown below:
Dealer: 1 2 3 4
Quantity: 150 160 110 130
The store estimates that profit per unit will vary with the dealer as shown below:
Dealers → Container 1 2 3 4
type
↓
1 8 9 6 3
2 6 11 5 10
3 3 8 7 9
Find the maximum profit of the store,
102. Obtain an optimum basic feasible solution to the following transportation problem;
To
7 3 4 2
2 1 3 3
From Available
3 4 6 5
4 1 5 10
103. A company has three plants at locations A, Band C which supply to warehouses located as D, E, F, G
and H. Monthly plant capacities are 800, 500 and 900 units respectively. Monthly warehouse requirements are
400,400, 500, 400 and 800 units respectively. Unit, transportation costs in rupees are given below:
To
D E F G H
A 5 8 6 6 3
From
B 4 7 7 6 6
C 8 4 6 6 3

Determine an optimum distribution for the company in order to minimize the total transportation cost.
104. Four jobs are to be done on four different machines. The cost (in rupees) of producing ith job on the jth
machine is given below:
Machines
M1 M2 M3 M4
J1 15 11 13 15
Jobs J2 17 12 12 13
J3 14 15 10 14
J4 16 13 11 17
Assign the jobs to different machines so as to minimize the total cost.
105. A marketing manager has 5 salesmen and 5 sales districts. Considering the capabilities of the salesmen
and the nature of districts, the marketing manager estimates that sales per month (in hundred rupees) for each
salesman in each district would be as follows:

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 10
 SAMSKARA IAS ACADEMY

Sales districts
A B C D E
1 32 38 40 28 40
2 40 24 28 21 36
Salesman
3 41 27 33 30 37
4 22 38 41 36 36
5 29 33 40 35 39
Find the assignment of salesmen to districts that will result in maximum sales.
106. A firm plans to begin production of three new products on its three plants. The unit cost of producing i
at plant j is as given below. Find the assignment that minimizes the total unit cost.
Plant
1 2 3
1 10 8 12
Product
2 18 6 14
3 6 4 2
107. Solve the following assignment problem:
1 2 3 4
A 10 12 19 11
B 5 10 7 8
C 12 14 13 11
D 8 15 11 9
108. A machine tool company decides to make four sub-assemblies through four contractors. Each contractor
is to receive only one sub-assembly. The cost of each sub-assembly is determined by the bids submitted by each
contractor and, is shown in table below (in hundreds of rupees). Assign different assemblies to contractors so as
to minimize the total cost.
Contractor
A B C D
I 15 13 14 17
Sub-assembly II 11 12 15 13
III 18 12 10 11
IV 15 17 14 16
109. Four professors are each capable of teaching anyone of the four different courses. Class preparations
time in hours for different topics varies from professor to professor and is given in the table below. Each
professor is assigned only one course. Find the assignment policy schedule so as to minimize the total course
preparation time for all courses.
Prof L.P. Queuing Theory Dynamic Regression
Programming analysis
A 2 10 9 7
B 15 4 14 8
C 13 14 16 11
D 3 15 13 8
110. Consider the problem of assigning four working labour units to four JODS. The assignment costs in
thousands of rupees are given by the following matrix.
Labour unit Job
↓ I II III IV
L1 42 35 28 21
L2 30 25 20 15
L3 30 25 20 15
L4 24 20 16 12
Find the optimal assignment.

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 11
 SAMSKARA IAS ACADEMY

111. A company has six jobs to be processed by six mechanics. The following table gives the return in rupees
when the ith job is assigned to the jth mechanic. How should the jobs be assigned to the mechanics so as to
maximize the over all return?
Mechanic Job
↓ I II III IV V VI
1 9 22 58 11 19 27
2 43 78 72 50 63 48
3 41 28 91 37 45 33
4 74 42 27 49 39 32
5 36 11 57 22 25 18
6 13 56 53 31 17 28

AP-729, H-BLOCK, 12TH MAIN ROAD, ANNA NAGAR WEST, CHENNAI - 40 [email protected] 9344054321 12