Institute For Ias/Ifos Examinations: Linear Programming Problem

INSTITUTE FOR IAS/IFOS EXAMINATIONS
MATHEMATICS OPTIONAL
By
K. VENKANNA
WORKSHEET - 1
LINEAR PROGRAMMING PROBLEM
QLP
(QUICK LEARNING PROGRAMME FOR MAINS-2016)
Scoring Maximum Marks in Main-2016
FEATURES OF MATHEMATICS PROGRAMME
• Class Timings – 9:30 AM – 5:30 PM.
• Atleast one day one module to be discussed (Expected)
• A question based approach to be followed.
• Pin-pointed formulas to be provided.
• 15-20 problems to be provided on each formula set.
• Time-bound problem solving sessions.
• On board discussion sessions to be followed there after.
• Around 50-100 problems expected to be solved per session.
• Only problems to be discussed, no concept explanation.
• Sessions will be from Monday to Friday.
H.O. : 25/8, Old Rajinder Nagar, New Delhi-110060 Ph. : 011-45629987, 9999197625
B.O.: 105-106, Top Floor, Mukherjee Tower, Mukherjee Nagar, Delhi-09
B.O.: H.No. 1-10-237, 2nd Floor,
Room No. 202, R.L’S-Kancham’s Blue Supphire, Ashok Nagar, Hyderabad-20.
IAS MATHEMATICS (MAINS): TOPIC-WISE PRACTICE SETS (2)
WORKSHEET - 1
1. Put the following program in standard form transportation costs per truck load of cement
minimize z � x1 � 2 x2 � 3x3 (in hundreds of rupees) from each plant to each
project site are as follows.
Subject to 3 x1 � 4 x3 � 5
Project Site
5 x � x2 � 6 x3 � 7 1 2 3 4
8 x1 � 9 x3 � 2 1 2 3 11 7
x1 , x2 , x3 � 0 Factories 2 1 0 6 1
and hence obtain initial feasible solution. 3 5 8 15 9
2. Use simplex method solve the following Determine the optimal distribution for the company
so as to minimize the total transportion cost.
maximize z � x1 � 2 x2
Subject to � x1 � 2 x2 � 8 6. Sove the following L.P.P. by simplex method.
Minimize z � x1 � 3 x2 � 3 x3
x1 � 2 x2 � 12
Subject to 3 x1 � x2 � 2 x3 � 7
x1 � 2 x2 � 3
2 x1 � 4 x2 � �12
x1 � 0 and x2 � 0
�4 x1 � 3 x2 � 8 x3 � 10
3. Wrire the dual of the problem x1 , x2 , x3 � 0.
maximize z � x1 � 2 x2 � 3x3
7. Obtain the dual problem of the followign LPP
subject to �2 x1 � x2 � 3 x3 � 2
minimize z � x1 � 3 x2 � 2 x3
2 x1 � 3 x2 � 4 x3 � 1 subject to the constraints
x1 , x2 , x3 � 0 3 x1 � x2 � 2 x3 � 7
2 x1 � 4 x2 � 12
4. Show that the following system of linear equations
�4 x1 � 3 x2 � 8 x3 � 10
has two degenrate feasible basic solutions and
the non-degenerate basic solution is not feasible. x1 , x2 � 0 and x3 is unrestricted.
2 x1 � x2 � x3 � 2
8. Write the dual of the following linear programming
3 x1 � 2 x2 � x3 � 3 in a form such that dual variables are all non-
negative.
5. A company has three cement factories located in Maximise Z � 3 x1 � 2 x2 � 4 x3 � x4
cities 1, 2, 3 which supply cement to four projects Subject to
located in towns 1, 2, 3, 4. Each plant can supply
6, 1, 10 truck loads of cement daily respectively 6 x1 � 4 x2 � 3 x3 � 2 x4 � 2
and the daily cement requirements of the projects 4 x1 � 3 x2 � 2 x3 � x4 � 3
are respectively 7, 5, 3, 2 truck loads. The
x1 , x2 unrestricted, x3 , x4 � 0 .
H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

B.O.: 105-106, Top Floor, Mukherjee Tower, Dr. Mukherjee Nagar, delhi-9
Ph : 011-45629987, 09999197625 || Email : ims4ims2010@gmail.com, www.ims4maths. com
14. Find the dual of the following linear programming

9. Using simplex method, solve the following L.P.P. problem;
Maximize Z � x1 � 3x2 Maximize Z � 3 x1 � 4 x2
Subject to Subject to 4 x1 � 2 x2 � 7
x1 � 2 x2 � 10,
x1 � 3 x2 � 5
0 � x1 � 5.
x1 , x2 unrestricted.
0 � x2 � 4.
15. Use simplex method solve the following
10. Solve the following Linear Programming Program Maximize Z � 2 x1 � x2
graphically
Maximise Z � 3 x1 � 2 x2
Subject to the constraints 4 x1 � x2 � 8
x1 � x2 � 0 4 x1 � x2 � 8
3 x1 � 2 x2 � �3; x1 , x2 � 0. x1 , x2 � 0.
11. Solve the following by simplex method 16. Let x1 � 1, x2 � 1 and x3 � 1 be a feasible solution
Maximize z � 4 x1 � 10 x2 to the system of equations
Subject to 2 x1 � 3x2 � x3 � 4
2 x1 � x2 � 50 �5 x1 � 6 x2 � x3 � 2.
2 x1 � 5 x2 � 100
2 x1 � 3 x2 � 90 17. Solve the following transportation problem
x1 , x2 � 0. D1 D 2 D3 D4 D5 D6 Availability
S1 10 12 13 8 14 19 18
12. Find all the basic solutions to the following problem: S2 15 18 12 16 19 20 22
Max Z � x1 � 3x2 � 3 x3 S3 17 16 13 14 10 18 39
S4 19 18 20 21 12 13 14
Subject to
Demand 10 11 13 20 24 15
x1 � 2 x2 � 3x3 � 4
2 x1 � 3x2 � 5 x3 � 7 18. Solve the following linear programming problem
graphically
with x1 , x2 � 0.
Minimise z � 32 x1 � 24 x2
which of the basic solutions are
Subject to the constraints
(a) non-degenerate basic feasible
(b) optimal basic feasible. x1 � 8
x2 � 10
13. Solve the following transportation problem:
5 x1 � 3x2 � 55
Destination
x1 , x2 � 0.
Origin D1 D 2 D3 D4 Availability
O1 1 2 1 4 30 19. Solve the followign by Simplex method.
O2 3 3 2 1 50 Maximize z � 2 x1 � 3x2
O3 20
4 2 5 9 Subject to x1 � x2 � 4
Requirement 20 40 30 10

� x1 � x2 � 1 24. Write the dual of the following LPP.
x1 � 2 x2 � 5 Min. z � x1 � x2 � x3 .
Subject to the constraints:
x1 � 0, x2 � 0.
x1 � 3x2 � 4x3 � 5, x1 � 2 x2 � 3, 2 x2 � x3 � 4i x,
20. A manufacturer produces two types of models x � 0 and x3 unrestricted.
1 2
M1 and M2. Each M1 model requires 4 hours of
grinding and 2 hours of polishing; whereas each 25. Solve the following by Simplex method
M2 model requires 2 hours of grinding and 5 hours
of polishing. The manufacturer has 2 grinders and Minimize z � x2 � 3 x3 � 2 x5 ,
3 polishers. Each grinder works for 40 hour a Subject to the constraints:
week and each polisher works for 60 hours a 3 x2 � x3 � 2 x5 � 7 , �2 x2 � 4 x3 � 12,
week. Profit on an M1 model is Rs. 3 and on an
M2 model is Rs. 4 whatever is produced in a week �4 x2 � 3x3 � 8 x5 � 10, and x2 , x3 , x5 � 0 .
is sold in the market. How should the
manufacturer allocate his production capacity to 26. The owner of a small machine shop has 4
the two types of models so that he may make the mechanists available to do 4 jobs. Jobs are offered
maximum profit in a week. with expexted profits for each mechanist as
follows.
21. Solve the following by simplex method
Maximize Z = 5x1 + 3x2 I II III IV
Subject to A 6 7 5 2
2 x1 � x2 � 1, B 4 3 2 8
C 2 4 9 4
x1 � 4 x2 � 6,
D 5 3 1 7
x1 , x2 � 0.
Find by using the assignment method, the
22. Put the following program in standard form assignment of mechanists to jobs that will result
in a maximum profit.
Minimize Z � 25 x1 � 30 x2
Subject to 27. Write the dual of the following LPP.
4 x1 � 7 x2 � 1 Maximize Z = 3x1 + x2 + x3 – x4
8 x1 � 5 x2 � 3 Subject to the constraints:
6 x1 � 9 x2 � �2 x1 � 5 x2 � 3 x3 � 4 x4 � 5
and hence obtain an initial feasible solution. x1 � x2 � �1
x3 � x4 � �5
23. Solve the transportation problem,. whose unit cost
matrix, supply and demand are given below: x1 , x2 , x3 , x4 � 0.
D1 D2 D3 D4 D5 Supply 28. Solve the following by simplex method

O1 7 7 10 5 11 45 Maximize Z = 3x1 + 9x2
O2 4 3 8 6 13 90 Subject to the constraints
O3 9 8 6 7 5 95 x1 � 4 x2 � 8
O4 12 13 10 6 3 75
x1 � 2 x2 � 4.
O5 5 4 5 6 12 105
Demand 20 80 50 75 85 and x1 , x2 � 0.

29. Put the following program in standard form.

Minimize Z = x1 + 2x2 + 3x3
5 x1 � x2 � 6 x3 � 7
8 x1 � 9 x3 � 2.
and hence obtain initial feasible solution.
30. Let x1 = 1, x2 = 1, andand x3 = 1 be a feasible

solution to the system of equations
2 x1 � 3x2 � x3 � 4
�5 x1 � 6 x2 � x3 � 2
Reduce the given feasible solution to a basic
feasible solution.

By
K. VENKANNA
WORKSHEET - 2
QLP
B.O.: H.No. 1-10-237, 2nd Floor,
WORKSHEET - 2
1. Using simplex method, solve the following LPP by finding the initial solution by matrix minima
Maximize Z � x1 � 3 x2 method.
Subject to x1 � 2 x2 � 10 6. Write the dual of the following LPP
0 � x1 � 5 Maximize Z � 4 x1 � 2 x2
0 � x2 � 4. Subject to x1 � 2 x2 � 2
2. Show algebraically that all the basic solutions of x1 � 2 x2 � 8

the following LP are infeasible. x1 � x2 � 10
Maximize = x1 + x2
x1 � 0 and x2 unrestricted in sign.
Subject to x1 � 2 x2 � 6
2 x1 � x2 � 16 7. A certain equipment needs five repair jobs which
x1 , x2 � 0. have to be assigned to five machines. The
estimated time (in hours) that each mechanic
3. Solve the following LPP by simplex method. requires to complete the repair job is given in the
Maximize Z = 3x1 + 2x2 following table
Subject to
Job
2 x1 � x2 � 5 Machine
J1 J2 J3 J4 J5
x1 � x2 � 3 M1 7 5 9 8 11
x1 , x2 � 0 M2 9 12 7 11 10
M3 8 5 4 6 9
4. Find the dual of the problem M4 7 3 6 9 5
Maximize Z = 5x1 + 6x2 M5 4 6 7 5 11
Subject to x1 � 2 x2 � 5
Aswsuming that each mechanic can be assigned
� x1 � 5 x2 � 3 to only one job, determine the minimum time
4 x1 � 7 x2 � 8 assignment.
x1 unrestricted, x2 � 0.
8. Solve the following linear programming problem
graphically.
5. Solve the following transportation problem
Minimize Z � 32 x1 � 24 x2
Destinations Subject to constraints
D1 D2 D3 D4 D5 D6 Availability
F1 2 1 3 3 2 5 50 x1 � 8
F2
Factories 3 2 2 4 3 4 40
x2 � 10
F3 3 5 4 2 4 1 60
F4 4 2 2 1 2 2 30 5 x1 � 3x2 � 55
Demand 30 50 20 40 30 10
x1 , x2 � 0.
9. Solve the following by simplex method 3 x1 � 2 x2 � 6

Maximize Z � 2 x1 � 3x2 2 x1 � x2 � 2
Subject to x1 � x2 � 4 x1 , x2 � 0
� x1 � x2 � 1 14. Find an optimal solution to the following LPP by
computing all basic solutions and then finding one
x1 � 2 x2 � 5
that maximizes the objective function.
x1 � 0, x2 � 0. Max Z � 2 x1 � 3x2 � 4 x3 � 7 x4
Subject to
10. The owner of a small machine shop has 4
2 x1 � 3x2 � x3 � 4 x4 � 8
mechanists available to do 4 jobs. Jobs are offered
with expected profits for each mechanist as x1 � 2 x2 � 6 x3 � 7 x4 � �3
follows. x1 , x2 , x3 , x4 � 0.
Mechanists
I II III IV 15. Reduce the feasible solution x1 � 2, x2 � 1, x3 � 1 for

the linear programming problem
A 6 7 5 2
Maximize Z � x1 � 2 x2 � 3x3
Jobs B 4 3 2 8
Subject to
C 2 4 9 4
x1 � x2 � 3 x3 � 4
D 5 3 1 7
2 x1 � x2 � x3 � 6
find by using the assignment method, the
assignment of mechanists to jobs that will result x1 , x2 , x3 � 0
in a maximum profit. to a basic feasible solution.
11. Let x1 � 1, x2 � 1 and x3 � 1 be a feasible solution 16. Is x13 � 50, x14 � 20, x21 � 55, x31 � 30, x32 � 35, x34 � 25
to the system of equations. an optimum solution of the following
transportation problem?
2 x1 � 3x2 � x3 � 4
To
�5 x1 � 6 x2 � x3 � 2 Available units
6 1 9 3 70
feasible solution. From 11 5 2 8 55
12. Solve the Transportation problem, whose unit cost 10 12 4 7 90

matrix, supply and demand are given below: Required units 85 35 50 45
D1 D2 D3 D4 D5 Supply
O1 7 7 10 5 11 45 17. Solve by simplex method, the following LP
O2 4 3 8 6 13 90 problem:
O3 9 8 6 7 5 95 Maximize Z = 3x1 + 4x2
O4 12 13 10 6 3 75 Subject to
O5 5 4 5 6 12 105 x1 � x2 � 1
Demand 20 80 50 75 85 � x1 � x2 � 2
x1 , x2 � 0
13. Solve by simplex method, the following LP
problem,
18. Four intravenous fluid manufacturing plants are
Maximize Z � 2 x1 � 5 x2 located at S1 , S 2, S 3 & S 4 which supply the
Subject to

Hospitals located at H1, H2, H3, H4 & H5. Daily 3 x1 � 8 x2 � 12

plant capacities are 80, 120, 125 and 75 units
x1 , x2 � 0.
respesperty. Daily hospital requirements are 30,
70, 150, 50 and 100 units respectivly. Unit
transporation costs (in Rs) are given below: 23. Write the dual of the LPP
Minimize Z � 4 x1 � 6 x2 � 18x3
To
H1 H2 H3 H4 H5 Subject to the constraints
S1 6 8 15 17 9 x1 � 3x2 � 3
S2 11 13 7 4 16 x2 � 2 x3 � 5
From
S3 13 15 8 6 11
x1 , x2 , x3 � 0.
S4 10 5 9 3 6
Determine the optimum distribution for the plants 24. Find all the basic solutions to the following problem:
in order to minimize the total transportation cost. Max Z � x1 � 3x2 � 3x3
Subject to
19. Does the following LPP has a feasible solution? x1 � 2 x2 � 3x3 � 4
Max Z = x1 � x2
2 x1 � 3x2 � 5 x3 � 7
Subject to
with x1 , x2 � 0.
x1 � x2 � 0
which of the basic solutions are
3 x1 � x2 � �3. (a) non-degenerate basic feasible
show with the help of a graph. (b) optimal basic feasible.
20. Solve the following LPP by simplex method 25. Construct the dual of the primal problem:
Maximize Z = 6 x1 � 2 x2 Maximize z � 2 x1 � x2 � x3 , subject to the
Subject to constraints
2 x1 � x2 � 2 x1 � x2 � x3 � 6,3x1 � 2x2 � 3x3 � 3, �4x1 � 3x2 � 6x3 � 1,
x1 � 4 x1 , x2 , x3 � 0.
x1 , x2 � 0.
Show that it has unbounded feasible region but 26. Solve the following transportation problem:
bounded optimal solution. Destination
Origin D 1 D 2 D 3 D 4 Availability
O1 1 2 1 4 30
21. Let x1 � 2, x2 � 4 and x3 � 1 be a feasible solution
O2 3 3 2 1 50
to the system of equations O3 4 2 5 9 20
2 x1 � x2 � 2 x3 � 2 Requirement 20 40 30 10
x1 � 4 x2 � 18
27. Solve the following assignment problem:
feasible solution.
1 2 3 4
22. By using simplex method solve the following LPP.
A 10 12 19 11
Max Z � 5x1 � 3x2
B 5 10 7 8
C 12 14 13 11
x1 � x2 � 2
D 8 15 11 9
5 x1 � 2 x2 � 10

28. Solve by simplex method

Maximize Z � 3 x1 � 2 x2
subject to the constraints:
2 x1 � x2 � 2,
3 x1 � 4 x2 � 12,
x1 , x2 � 0.
29. An aeroplane can carry a maximum of 200
passengers. A profit of Rs. 400 is made on each
first class ticket and a profit of Rs. 300 is made on
each economy class ticket. Then 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. Determine
graphically how many tickets of each class must
be sold in order to maximize profit for the airline?
30 Minimize Z � 2 x1 � 3 x2 � 4 x3
Subject to
2 x1 � 3 x2 � 5 x3 � 2,3 x1 � x2 � 7 x3 � 3,
x1 � 4 x2 � 6 x3 � 5, x1 , x2 � 0 and x3 is unrestricted.

By
K. VENKANNA
WORKSHEET - 3
QLP
B.O.: H.No. 1-10-237, 2nd Floor,
WORKSHEET - 3
1. Find all the basic solutions to the following problem:

Maximize Z � x1 � 3x2 � 3 x3 , Plants Distribution Centers Availabilities
D1 D2 D 3 D4
Subject to x1 � 2 x2 � 3x3 � 4, 2 x1 � 3x2 � 5 x3 � 7.
P1 19 30 50 12 7
Which of the basic solutions are P2 70 30 40 60 10
(i) non-degenerate basic feasible, P3 40 10 60 20 18
(ii) optimal basic feasible? Requirements 5 8 7 15
2. A company has three plants at locations A, B and

What can be the maximum saving by optimal
C which supply to warehouses located as D, E,
scheduling.
F, G and H. Monthly plant capacities are 800,
500 and 900 units respectively. Monthly
5. A pine-apple firm produces two products: canned
warehouse requirements are 400, 400, 500, 400
pine-apple and canned juice. The specific amounts
and 800 units respectively. Unit transportation
of material, labour and equipment required to
costs in rupees are given below:
produce each product and the availability of each
To of these resources are shown in the table given
D E F G H
below:
A 5 8 6 6 3
Canned Juice Pine-apple Available resources
From B 4 7 7 6 6
Labour (man hrs.) 3 2.0 12.0
C 8 4 6 6 3 Equipment (m/c hrs) 1 2.3 6.9
Determine an optimum distribution for the Material (units) 1 1.4 4.9
company in order to minimize the total Assuming one unit each of canned juice and canned
transportation cost. pine-apple has profit margins of Rs. 2 and Rs1.
respectively. Formulate it as L.P. problem and solve
3. Construct the dual of the L.P.P.: it graphically.
Maximize Z � 4 x1 � 9 x2 � 2 x3 ,
6. If x1 � 2, x2 � 3, x3 � 1 be a feasible solution of the
Subject to following Linear Programming problem then find
2 x1 � 3 x2 � 2 x3 � 7,3 x1 � 2 x2 � 4 x3 � 5, x1 , x2 , x3 � 0. the basic feasible solution:
Maximize
4. A company is spending Rs. 1,000 on transportation z � x1 � 2 x2 � 4 x3

of its units from plants to four distribution centres. Subject to the constraints
The supply and demand of units, with unit cost of 2 x1 � x2 � 4 x3 � 11.
transportation are given below:
3 x1 � x2 � 5 x3 � 14. 12. Use simplex method, to solve

Maximize z � 3 x1 � 2 x2
and x1 , x2 , x3 � 0.
7. Use simplex method to Maximize z � 3 x1 � 2 x2
2 x1 � x2 � 2,3 x1 � 4 x2 � 12, x1 , x2 � 0.
Subject to the constraints:
2 x1 � x2 � 2,3 x1 � 4 x2 � 12 13. Find the optimal assignment cost from the
following cost matrix.
x1 , x2 � 0.
8. A department head has four tasks tobe performed A B C D
I 4 5 4 3
and three subordinates, the subordinates differ in
II 3 2 2 6
efficiency. The estimates of the time, each
III 4 5 3 5
subordinate would take to perform, is given below
IV 2 4 2 6
in the matrix. How should he allocate the tasks one
to each man, so as to minimize the total man-hours?
14. x1 � 4, x2 � 1, x3 � 3 is a feasible solution of the
Task Men
1 2 3 system of equations
I 9 26 15 2 x1 � 3x2 � x3 � 8
II 13 27 6
III 35 20 15 x1 � 2 x2 � 3 x3 � 15
IV 18 30 20 Reduce the feasible solution to two different basic
feasible solutions.
9. Give the dual of the following problem in a form
such that the dual variables are non-negative and
15. Write the dual of the problem
no strict equations appear in the dual constraints.
Minimise Z = 2x2 + 5x3
Maximize z � x � 2 y
Subject to
Subject to 2 x � 3 y � 4,3x � 4 y � 5, x � 0 and y
x1 � x2 � 2
unrestricted.
2 x1 � x2 � 6 x3 � 6
10. Find the dual of the following L.P.P: x1 � x2 � 3 x3 � 4
Maximize � � 2x1 � x2 x1 , x2 , x3 � 0
Subject to
x1 � 5 x2 � 10, x1 � 3 x2 � 6,2 x1 � 2 x2 � 8; 16. Use simplex method to solve the LPP.
Maximise Z = 3x1 + 2x2
x2 � 0 and x1 unrestricted in sign.
Subject to x1 � x2 � 4
11. Find the optimum solution to the following x1 � x2 � 2; x1 , x2 � 0

Transportation Problem:
17. Consider the following data.
Factory Warehouse Capacity
Destinations
D E F G
1 2 3
A 42 48 38 37 160
Capacities
1 2 2 3 10
Sources
B 40 49 52 51 150 2 4 1 2 15
C 39 38 40 43 190 3 1 3 x 40
Demand 80 90 110 160 20 15 30
Demands
The cost of shipment from third source to the 22. A company has three plants at locations A, B and
third distination is not known. How many units C, which supply to warehouses located at D, E,
should be transported from the sources to the F, G and H. monthly plant capacities are 800, 500
destinations so that the total cost of transporting
and 900 units respectively. Monthly warehouse
all the units to their destinations is a minimum?
requirements are 400, 400, 500, 400 and 800 units
18. Find all the basic solutions to the following problem: respectivley. Unit transportation costs (in rupees)
Max Z � x1 � 3x2 � 3x3 are given below :
Subject to
x1 � 2 x2 � 3x3 � 4 To
2 x1 � 3x2 � 5 x3 � 7 D E F G H
with x1 , x2 � 0. A 5 8 6 6 3
From
which of the basic solutions are B 4 7 7 6 5
(i) non-degenerate basic feasible C 8 4 6 6 4
(ii) optimal basic feasible.
19. Solve the following transportation problem:
Determine an optimum distribtution for the
company in order to minimize the total
Destination transportation cost.
Origin D1 D2 D3 D4 Availabity
O1 1 2 1 4 30 13. Let x1 = 2, x2 = 4 and x3 = 1 be a feasible solution
O2 3 3 2 1 50 to the system of equations
O3 4 2 5 9 20 2x1 – x2 + 2x3 = 2
Re quirement 20 40 30 10 x1 + 4x2 = 18
20. Solve by simplex method, the following LP fensible solution.
problem:
Maximize Z = 3x1 + 4x2 24. Solve the following asignment problem
� x1 � x2 � 2 A B C D
I 1 4 6 3
x1 , x2 � 0
II 9 7 10 9
III 4 5 11 7
21. Write the dual of the following LPP. IV 8 7 8 5
Maximize z = 2x1 + 5x2 + 3x3
Subject to 2x1 � 4x 2 � 3x 3 � 8 25 Solve the following LP problem by simplex
�2x1 � 2x 2 � 3x 3 � �7 method.
Minimise z = 8x1 –2x2
x1 � 3x 2 � 5x 3 � �2
Subject to
4x1 � x 2 � 3x 3 � 4 �4x1 � 2x 2 � 1
x1 , x 2 , x 3 � 0 5x1 � 4x 2 � 3
x1 , x 2 � 0


By
K. VENKANNA
WORKSHEET - 4
QLP
B.O.: H.No. 1-10-237, 2nd Floor,


the production cost, while still meeting the market The estimate of the time required by each person
demand ? to complete each task as shown in the table below.
Assign a task to each man so as to minimise the
16. A product is produced by four factories F1, F2, total time spent on the four assignments.
F3, F4. The unit production costs in them are Rs.
2, Rs 3, and Rs. 5 respectively. Their production Man
capacities are : F1 – 50 units, F2 – 70 units, F3 – A B C D
30 units, F4 – 50 units. These factories supply the
product to four stores S1, S2, S3 and S4, demands a 18 26 17 11
of which are 25, 35, 105 and 20 units respectively.
Unit transport cost in rupees from each factory b 14 28 14 26
Task
to each store is given in the table below.
Determine the extent of derivaties from each of c 38 19 18 15
the factories to each of the stores so that the
total production and transportation cost is d 19 26 24 10
minimum.
S1 S2 S3 S4
21. Two products are manufactured sequentially on
F1 2 4 6 11
two machines. The time available on each
machine in 8 hours per day and may be increased
F2 10 8 7 5
by up to 4 hours of overtime, If necessary at an
additonal cost of Rs. 100 per hour. The table
F3 13 3 9 12
below gives the production rate on the two
machines as well as the price per unit of the two
F4 4 6 8 3
products. Determine the optimum production
schedule and the recommended use of overtime
if any.
17. Show that the following system of linear equations Production rate (units/hr)
has two degenerate basic feasible solutions and Product 1 Product 2
the non-degenerate basic solution is not feasible : Machine 1 5 5
Machine 2 8 4
3x1 + x2 – x3 = 3 Price per unit (Rs) 110 118
2x1 – x2 + x3 = 2.
22. Solve the following LPP by Simplex Method
18. Write down the dual of the following LPP. Maximize Z = 3x1 + 9x2
Maximise Z = x1 – x2 – 3x3 + 2x4 Subject to
subject to x1 + x2 � 1 x1 + 4 x2 ��8
x1 – 3x2 – x3 � 7 x1 + 2x2 ��4
x1 + x3 – 3x4 = – 2 x1 , x2 ��0
x1 , x 2 � 0
x3, x4 are unrestricted in sign. 23. Write the dual of the following LP
Maximize Z = 5x1 + 12 x2 + 4x3
19. Solve the LPP.
Maximise Z = x1 – 2x2 subject to
Subject to x1 + 2x2 ��1 x1 + 2x2 + x3 ��10
– x1 + x2 ��1 2x1 – x2 + 3x3 = 8
x1 , x2 ��0. x1, x2 , x3 ��0
Show that it has unbounded solution. what can
you say about the nature of the solution of its 24. Find all the basic solutions of the following system
dual.?
of equations identifying in each case the basic
20. There are four men and each of them has to and non-basic variables :
perform one of the four tasks. The men differ in 2x1 + x2 + 4x3 = 11, 3x1 + x2 + 5x3 = 14.
their efficiency and ability to complete the tasks.

Investigate whether the basic solutions are 30. Obtain the dual problem of the following
degenerate basic solutions or not. Hence find the Maximize z = x1 – 2x2 + 3x3
basic-feasible solution of the system. subject to
–2x1 + x2 + 3x3 = 2
25. Solve the following transportation problem : 2x1 + 3x2 + 4x3 = 1
Destination
D1 D2 D3 D4
x 1 , x2 , x3 � 0
O1 1 2 1 4 30
31. Use simplex method to solve the following
Origin O2 3 3 2 1 50 Availability
maximize z = 5x1 + 2x2
O3 4 2 5 9 20 subject to
20 40 30 10 100 6x1 + x2 � 6
Requirement
4x1 + 3x2 � 12
26. Solve x1 + 2x2 � 4
Minimize Z = 7.5 x1 – 3x2 x1 , x 2 � 0
Subject to the constraints 3x1 – x2 – x3 ��3, x1 –
x2 + x3 � 2, x1 x2 x3 �� 32. Solve the following transportation problem
Destinations
27. Find all the the basic feasible solutions of the
equations D1 D2 D3 D4 D5 D6 Availability
2x1 + 6x2 + 2x3 + x4 = 3 F1 2 1 3 3 2 5 50
6x1 + 4x2 + 4x3 + 6x4 = 2.
F2 3 2 2 4 3 4 40
x1, x2, x3, x4 � 0. Show that all the basic solutions Factories
F3 3 5 4 2 4 1 60
are degenerate.
F4 4 2 2 1 2 2 30
28. Show that the following LPP has no feasible 30 50 20 40 30 10
solution:
Maximise Z = x1 + 4x2 + 3x3
subject to 2x1 – x2 + 5x3 = 40 by finding the initial solution by matrix minima
x1 + 2x2 – 3x3 ��22 method.
3x1 + x2 + 2x3 = 30
x1, x2, x3 ��0. 33. Let x1 = 2, x2 = 4 and x3 = 1 be a feasible solution
to the system of equations 2x1 – x2 + 2x3 = 2,
29. A construction company has to move four large x1 + 4x2 = 18 . Reduce this feasible solution to a
cranes from old construction site to new construction basic feasible solution.
site. The distance in kilometres between the old and
new locations are as given in the adjoining table. 34. Solve the transportation problem, whose unit cost
The crane at O3 cannot be used at N2 but all the matrix, supply and demand are given below :
cranes can work equally well at any of the other D1 D 2 D3 D4 D5 Supply
new sites. Determine a plan for moving the cranes
O1 7 7 10 5 11 45
that will minimise the total distance involved in the
move. O2 4 3 8 6 13 90
O3 9 8 6 7 5 95
New Cons. sites
N1 N2 N3 N4 O4 12 13 10 6 3 75
O1 15 20 13 40 O5 5 4 5 6 12 105
Old cons. sites O2 38 42 15 20 Demand 20 80 50 75 85
O3 25 17 30 18
O4 18 30 40 35

35. Write the dual of the following LPP and hence,

solve it by graphic maethod : D1 D2 D3 D4
Minimize Z = 6x1 + 4x2
O1 1 2 3 4 6
constraints
2x1 + x2 � 1 O2 4 3 2 0 8 Capacity
3x1 + 4x2 � 1.5 O3 0 2 2 1 10
x1 , x 2 � 0 4 6 8 6 24
36. Solve by simplex method, the following LP problem Demand
Maximize Z = 2x1 + 5x2
Subject to 3x1 + 2x2 � 6 where O i is the ith origin and D j is the jth
2x1 + x2 � 2 destination.
x1 , x 2 � 0 42. Show that the assignment problem is a special
37. Solve the following by simplex method case of the transportation problem. Indicate a
Maximize Z = 5x1 + 3x2 method of solving an assignment problem.
subject to 2x1 + x2 � 1,
x1 + 4x2 � 6, 43. When is a set K � En said to be convex? Show
x1, x2 � 0. that for a set K to be convex, it is necessary and
sufficient that every convex linear combination
38. Solve graphically : of points in K belongs to K. What is the role of
Maximize z = 7x + 4y the theory of convex sets in the solution of linear
subject to 2x + y � 2, x + 10y � 10 and x � 8. programming problems?
(Draw your own graph without graph paper).
44. Obtain the dual Problem of the following:
39. A manufacturer wats to maximise his daily output Maximize Z � x 1 � 2x 2 � 3x 3
of bulbs which are made by two processes P1 subject to the constraints:
and P2. If x1 is the output by process P1 and x2 is
�2 x1 � x2 � 3 x3 � 2
the output by process P2, then the total labour
hours is given by 2x1 + 3x2 and this cannot exceed 2 x1 � 3x2 � 4 x3 � 1
130, the total machine time is given by 3x1 + 8x2 x1 , x2 , x3 � 0
which cannot exceed 300 and the total raw
material is given by 4x1 + 2x2 and this cannot 45. Determine an initial basic feasible solution to the
exceed 140. What should x1 and x2 be so that the following transportation problem using the
total output x1 + x2 is maximum ? Solve by the north-west corner rule.
simplex method only. where Oi and Dj represent the ith origin and jth
destination respectively.
40. Solve the following transportation problem :
D1 D2 D3 D4
O1 6 4 1 5 14
D1 D2 D3 Supply
O2 8 9 2 7 16
O1 5 3 6 20 Availability
O3 4 3 6 2 5
O2 4 7 9 40
6 10 15 4 35
Demand 15 22 23 60
Requirement
41. Obtain an intial basic feasible solution to the

46. Consider the problem of assigning five jobs to
following transportation problem using the matrix
five persons. The assignment costs are as follows:
minima method:
Determine the optimum assignment schedule

52. The following table gives the cost for transporting

Job material from supply points A, B, C, D to demand
1 2 3 4 5
points E, F, G, H, J.
A 8 4 2 6 1
To
B 0 9 5 5 4
Person
E F G H J
C 3 8 9 2 6
D 4 3 1 0 3 A 8 10 12 17 15
B 15 13 18 11 9
From
E 9 5 8 9 5
C 14 20 6 10 13
D 13 19 7 5 12
47. Using dual simplex method solve the following
LPP: The present allocation is as follows:
Minimise z � 3x1 � x2 subject to the constraints. A to E 90; A to F 10; B to F 150; C to F 10
C to G 50; C to J 120; D to H 210; D to J 70
x, � x2 � 1 , 2 x1 � 3x2 � 2 , x1 � 0 , x2 � 0
(i) Check if this allocation is optimum. If not,
find an optimum schedule.
48. State the Transportation problem in general terms (ii) If in the above problem the transportation cost
and explain the problem of degeneracy. How does from A to G is reduced to 10, what will be the
one overcome it? new optimum schedule?
49. Use simplex method to solve the LPP: 53. Use the simplex method to solve:
Maximise Z � 3x1 � 2 x2 Minimize x0 � x1 � 3x2 � 2 x3
subject to the constraints
Subject to 3 x1 � x2 � 2 x3 � 7
2 x1 � x2 � 5
�2 x1 � 4 x2 � 12
x1 � x2 � 3
�4 x1 � 3x2 � 8 x3 � 10
x1 , x2 � 0
x1 , x2 , x3 � 0

54. A departmental head has four subordinates and
Destination four tasks are to be performed. The subordinates,
differ in efficiency and the tasks differ in their
A B C
intrinsic difficulty. His estimates of the times each
I 50 30 220 1 man would take to perform each task is given in
Source
Availability
II 90 45 170 3 the effectiveness matrix below. How should the
III 250 200 50 4 tasks be allocated one to one man, so as to
minimize the total man hours?
4 2 2 8
Requirement Man
I II III IV
51. Solve the following LPP A 8 26 17 11
Maximize Z � 3x1 � 2 x2 B 13 28 4 26
Subject to x1 � x2 � 4 C 38 19 18 15
x1 � x2 � 2 D 19 26 24 10
x1 , x2 � 0
55. Solve
Maximize Z � 3x1 � 2 x2 � 5 x3

Subject to x1 � 2 x2 � x3 � 430 If the cost coefficient of x1 is kept fixed, find the

range for the cost coefficient of x 2 without
3x1 � 2 x3 � 460
affecting the optimal solution.
x1 � 4 x2 � 420
x1 , x2 , x3 � 0 60. Solve the assignment problem represented by
following matrix for minimisation of costs. Find
also alternate solutions if any
56. Consider the following data.
Destinations I II III IV V VI
1 2 3 Capacities A 11 24 60 13 21 29
1 2 2 3 10
Sources
B 45 80 74 52 65 50
2 4 1 2 15
3 1 3 x 40 C 43 30 93 39 47 35
20 15 30 D 76 44 29 51 41 34
Demands
E 38 13 59 24 27 20
The cost of shipment from third source to the F 5 58 55 33 19 30
third destination is not known. How many units
should be transported from the sources to the
destinations so that the total cost of transporting 61. A Company has four plants P1, P2, P3, P4 from
all the units to their destinations is a minimum? which it supplies to three markets M1, M2, M3.
57. Solve the following LPP: Plant

Required
P1 P2 P3 P4
Maximize Z � x1 � 2 x2 � 3x3 � x4 at market
Subject to x1 � 2 x2 � 3x3 � 15 M1 21 16 25 13 11
Market
M2 17 18 14 23 13
2 x1 � x2 � 5x3 � 20
M3 32 27 18 41 19
x1 � 2 x2 � x3 � x4 � 10 Available
at plant
6 10 12 15 43
x1 , x2 , x3 , x4 � 0
Determine the optimal transportation plan using
58. Solve the transportation problem below for Modi method from the following data giving the
minimising the cost: plant to market shifting costs, quantities available
at each plant and quantities required at each
Store
market.
Costs 1 2 3 4 5 6 Availability
1 9 12 9 6 9 10 5 62. State the transportation problem in general terms
Warehouse
2 7 3 7 7 5 5 6 and explain the problem of degeneracy.

3 6 5 9 11 3 11 2
63. Use simplex method to solve the following LPP.
4 6 8 11 2 2 10 9
Maximise z � 4 x1 � 10 x2 subject to the constraints
Requirement 4 4 6 2 4 2 22
2 x1 � x2 � 50
2 x1 � 5 x2 � 100
59. Solve the LPP:
Maximise z � 3x1 � 5 x 2 2 x1 � 3x2 � 90
Subject to x1 � 4 x1 , x2 � 0
x2 � 6
64. Prove that a basic feasible solution to LPP must
3 x1 � 2 x2 � 18 correspond to an extreme point of the set of all
x1 , x2 � 0 feasible solutions.
66. Solve the unbalanced assignment problem in 69. Give the economic interpretation of duality in linear
minimization where programming.
12 10 15 22 18 8
70. Solve the following assignment problem for the
10 18 25 15 16 12 given assignment costs:
11 10 3 8 5 9
[Cij]= Person
6 14 10 13 13 12 I II III IV V
8 12 11 7 13 10 1 11 17 8 16 20
2 9 7 12 6 15
66. Respond True or False to the following, justify
Job
3 13 16 15 12 16
your answer in case of false:
4 21 24 17 28 26
(i) If the number of primal variables is much
smaller than the number of constraints, it is 5 14 10 12 11 13
more efficient to obtain the solution of the
primal by solving its dual.
71. Compute all basic feasible solutions of the linear
(ii) When the primal problem is non-optimal, the
programming problem.
dual problem is automatically infeasible.
(iii) An unrestricted primal variable will have the Maximize Z � 2 x1 � 3x2 � 2 x3
effect of yielding an equality dual constraint. Subject to 2 x1 � 3 x2 � x3 � 8
(iv) If the solution space is unbounded, the
x1 � 2 x2 � 6 x3 � �3
objective value always will be unbounded.
(v) The selection of the enterning variable from x1 , x2 , x3 � 0
among the current non-basic variables as the and hence indicate the optimal solution.
one with the most negative objective
coefficient guarantees the most increase in 72. Using duality or otherwise solve the LPP
the objective value in the next iteration.
Minimise 18 x1 � 12 x2
(vi) In the simplex method, the feasiblity condition
for the maximization and minimization Subject to 2 x1 � 2 x2 � �3
problems are different. 3x1 � 2 x2 � 3
(vii)A simplex iteration (basic solution) may not
necessarily coincide with a feasible extreme x1 , x2 � 0
point of the solution space.
(viii) If the leaving variable doesnot correspond 73. A manufacturer has distribution centres at Delhi,
to the minimum ratio, at least one basic Kolkata, and Chennai. These centres have
variable will definitely become negative in the available 30,50 and 70 units of his product. His
next iteration. four retail outlets require the following number of
units:
67. Develop mathematical model of a balanced A–30; B–20; C–60; D–40.
transportation problem. Prove that it always has The transportation cost per unit in rupees between
a feasible solution. each centre and outlet is given in the following
table.
68. Find the optimal assignment for the given
assignment costs: Distribution Retail Outlets
Machine centres A B C D
1 2 3 Delhi 10 7 3 6
1 5 7 9 Kolkata 1 6 7 3
Job 2 14 10 12 Chennai 7 4 5 3
3 15 13 16
Determine the minimum transportation cost.
74. Using simplex method maximize 45x1 � 80 x2 simplex method to determine the ingredients x1
subject to and x2 to be used to minimize cost.
5 x1 � 20 x2 � 400
79. Find the optimal solution for the assignment
10 x1 � 15 x2 � 450 : x1 , x2 � 0 problem with the following cost matrix.
75. A company has 3 factories A, B and C which 6 1 9 11 12

supply units to warehouses X, Y and Z. Every 2 8 17 2 5
month the capacities of the factories per month
11 8 3 3 3
are 60, 70 and 80 units at A, B and C respectively.
The requirements X, Y and Z per month are 50, 4 10 8 6 11
80 & 80- respectively. 8 10 11 5 13
X Y Z Indicate clearly the rule you apply to arrive at the

A 8 7 5 60 complete assignment.
B 6 8 9 70
80. Use simplex method to solve the LPP.
C 9 6 5 80
Maximize Z � 3x1 � 2 x2
50 80 80 210
The necessary data interms of unit transportation
x1 � x2 � 2; x1 , x2 � 0
costs in rupees, factory capacities and ware house
requirements are given above. Find the minimum
distribution cost. 81. Put the following program in standard form
minimize Z � 25x1 � 30 x2
76. Using Simplex method maximise Subject to 4 x1 � 7 x2 � 1
Z � 5x1 � 3x2 subject to
8 x1 � 5 x2 � 3
x1 � x2 � 2,
6 x1 � 9 x2 � �2
5 x1 � 2 x2 � 10, and hence obtain an initial feasible solution.
3 x1 � 8 x2 � 12,
82. Use simplex method to solve the following
x1 , x2 � 0.
maximize Z � 5 x1 � 2 x2
77. For the following system of equations Subject to 6 x1 � x2 � 6
x1 � x2 � x3 � 3 4 x1 � 3x2 � 12
2 x1 � x2 � 3x3 � 4 x1 � 2 x2 � 4
Determine and x1 , x2 � 0
(i) all basic solutions
(ii) all basic feasible solutions
83. Given the programme
(iii) a feasible solution which is not a basic feasible
solution. maximize Z � 5 x � 2 y
Subject to x � 3 y � 12
78. An animal feed company must produce 200 kg 3x � 4 y � 9
of a mixture consisting of ingredients x1 and x2
7 x � 8 y � 20
daily. x1 costs Rs. 3 per kg and x2 costs Rs. 8 per
kg. No more than 80 kg of x1 can be used, and x, y � 0
atleast 60 kg of x2 must be used. Formulate a Write its dual in the standard form.
linear programming model of the problem and use

84. Use the simplex method to solve the problem

Maximize u � 2 x � 3 y Tons of raw material per ton of Maximum
daily
Subject to �2 x � 3 y � 2 Exterior
paint
Interior
paint
availability
3x � 2 y � 5 Raw Material M1 6 4 24
x, y � 0 Raw Material M2 1 2 6
Profit per ton 5 4
(Rs.1,000)
85. Put the following in slack form and describe which
of the variables are 0 at each of the vertices of A market survey indicates that the daily demand
the constraint set and hence determine the vertices for interior paint cannot exceed that of exterior
algebraically: paint by more than 1 ton. The maximum daily
Maximise u � 4 x � 3 y demand of interior paint is 2 tons. The factory
wants to determine the optimum product mix of
Subject to x � y � 4
interior and exterior paint that maximizes daily
�x � y � 2 profits. Formulate the LP problem for this
x1 y1 � 0 situation.
86. Solve the following by simplex method 90. Maximize: Z � 3x1 � 5 x2 � 4 x3

Maximise u � x � y Subject to: 2 x1 � 3 x2 � 8,
Subject to � x � y � 1 3 x1 � 2 x2 � 4 x3 � 15,
x � 2y � 4 2 x2 � 5 x3 � 10,
x, y � 0
xi � 0.
87. Find the dual of the following LPP:

91. Construct the dual of the primal problem:
Maximize Z � 2 x1 � x2 � x3 Maximize Z = 2x 1 + x 2 + x 3 subject to the
Such that x1 � x2 � 3x3 � 8 constraints
4 x1 � x2 � x3 � 2 x1 � x2 � x3 � 6,
2 x1 � 3 x2 � x3 � 5 3 x1 � 2 x2 � 3x3 � 3,
x1 , x2 , x3 � 0 4 x1 � 3 x2 � 6 x3 � 1,
and x1 , x2 , x3 � 0.
Destinations 92. Determine an optimal transportation programme
so that the transportation cost of 340 tons of a
D1 D2 D3 D4 D5 D6 Availability
certain type of material from three factories F1,
F1 2 1 3 3 2 5 50 F2, F3 to five warehouses W1, W2, W3, W4, W5 is
Factories
F2 3 2 2 4 3 4 40 minimized. The five warehouses must receive 40

F3 3 5 4 2 4 1 60 tons, 50 tons, 70 tons, 90 tons and 90 tons
F4 4 2 2 1 2 2 30 respectively. The availability of the material at
Demand 30 50 20 40 30 10 F 1 , F 2 , F 3 is 100 tons, 120 tons, 120 tons
respectively. The transportation costs per ton from
by finding the initial solution by Matrix Minima factories to warehouses are given in the table
method. below:
89. A paint factory produces both interior and exterior

paint from two raw materials M1 and M2. The
basic data is as follows:
availability of the products P1, P2, P3 and P4 are

W1 W2 W3 W4 W5 respectively 25, 35, 55 and 70.
F1 4 1 2 6 9
F2 6 4 3 5 7 97. Maximize z = 2x1+3x2–5x3
subject to x1+ x2+ x3=7
F3 5 2 6 4 8
and 2x1–5x2+ x3 � 10, xi � 0.
Use Vogel’s approximation method to obtain the
initial basic feasible solution. 98. Solve the minimum time assignment problem :
Machines
93. Solve by Simplex method, the following LP M1 M2 M3 M4
Problem:
J1 3 12 5 14
Maximize, Z � 5 x1 � 3x2
J2 7 9 8 12
Constraints, 3x1 � 5 x2 � 15 J3 5 11 10 12
5 x1 � 2 x2 � 10 J4 6 14 4 11
x1 , x2 � 0
99. Minimize z = 5x1–4x2+6x3–8x4
94. Write down the dual of the following LP problem subject to the constraints
and hence solve it by graphical method: x1 + 2x2 –2x3 + 4x4 � 40
Minimise, Z � 6 x1 � 4 x2 2x1–x2+x3+2x4 � 8
4x1–2x2+x3–x4 � 10
Constraints, 2 x1 � x2 � 1 xi � 0
3 x1 � 4 x2 � 1.5
x1 , x2 � 0 100. Solve graphically :
Maximize z = 6x1+5x2
subject to
95. For each hour per day that Ashok studies
2x1 + x2 � 16
mathematics, it yields him 10 marks and for each
x1 + x2 � 11 1
hour that he studies physics, it yields him 5 marks.
x1 + 2x2 � 6
He can study at most 14 hours a day and he must
5x1 + 6x2 � 90
get at least 40 marks in each. Determine
x 1 , x2 � 0
graphically how many hours a day he should study
mathematics and physics each, in order to
101. Find the initial basic feasible solution to the
maximize his marks?
following transportation problem by Vogel’s
approximation method. Also, find its optimal
96. By the method of Vogel, determine an initial basic
solution and the minimum transportation cost:
feasible solution for the following transportation Destinations
problem:
Products P1, P2 , P3 and P 4 have to be sent to D1 D2 D3 D4 Supply
destinations D1, D2 and D3. The cost of sending O1 6 4 1 5 14
product Pi to destinations Dj is Cij, where the Origin O2 8 9 2 7 16
matrix O3 4 3 6 2 5
�10 0 15 5 � Demand 6 10 15 4
��Ci j �� 7 3 6 15 � .
� �
�� 0 11 9 13 �� 102. Find all optimal solutions of the following linear
The total requirements of destinations D1, D2 and programming problem by the simplex method :
D3 are given by 45, 45, 95 respectively and the

Maximize Z = 30x1 + 24x2 customers as possible. Following data have been

subject to 5x1 + 4x2 � 200 obtained from market survey.
x1 � 32
x2 � 40 Magazine Magazine
Television Radio
x1 , x 2 � 0 I II
Cost of an adv. `30,000 `20,000 `15,000 `10,000
Unit
103. Solve the following assignment problem to
No. of potential
maximize the sales : customers `2,00,000 `6,00,000 `15,50,000 `1,00,000
reached
Territories per unit
No. of female
I II III IV V customer `1, 50,000 `4,00,000 `70,000 ` 50,000
reached
A 3 4 5 6 7 per unit
B 4 15 13 7 6
Salesmen
C 6 13 12 5 11 The company wants to spend not more than
D 7 12 15 8 5 `4,50,000 on advertising. Following are further
requirements that must be met:
E 8 13 10 6 9
(i) at least one million exposures take place
among female customers.
104. Consider the following linear programming (ii) advertising on magazines be limited to
problem : `1,50,000
Maximize Z = x1 + 2x2 –3x3 + 4x4 (iii) at least 3 advertising units be bought on
subject to x1 + x2 + 2x3 + 3x4 = 12 magazine I and 2 units on magazine II
x2 + 2x3 + x4 = 8 (iv) the number of advertising units on television
x1 , x 2 , x 3 , x 4 � 0 and radio should each be between 5 and 10.
With these information formulate an LP
(i) Using the definition, find its all basic solutions. model for the problem.
Which of them degenerate basic feasible
solutions and which are non-degenerate 107. A company has 3 ware houses & 3 stores, the
feasible solutions? cost of shipping one unit from ware house ‘i’ to
(ii) Without solving the problem, show that it has store ‘j’ is given in the following table.
an optimal solutions of the basic feasible
solution(s) is/are optimal? To store ‘j’
1 2 3
105. Solve the following linear programming problem 1 0 2 0
by the simplex method. Write its dual. Also, write From
the optimal solution of the dual from the optimal ware 2 1 4 0
house ‘i’
table of the given problem: 3 0 2 4
Maximize Z=2x1 –4x2 + 5x3
If the requirements of the 3 stores are 70, 50, 30
subject to x1 + 4x2 –2x3 � 2
respectively and the quantities available at the
–x1 + 2x2 + 3x3 � 1
warehouses are 70, 30, 50 respectively, then find
x1, x2, x3 � 0
the minimum cost solution.
106. (Advertising media selection problem). An
108. By graphical method solve the linear programming
advertising company wishes to plan its advertising
strategy in three different media - Television, Problem: Maximize Z � 100 x1 � 40x2
Radio and Magazines. The purpose of advertising Subject to 5 x1 � 2 x2 � 1000
is to reach as large a number of potential 3x1 � 2 x2 � 900

x1 � 2 x2 � 500 find the all location so that the transportation cost

is minimum.
x1 , x 2 � 0
113. Explain the basic solution & a basic feasible
109. Using simplex methods olve the linear solution of a LPP. Determine the basic matrices
programming & find the basic feasible solutions of the linear
Problem Maximize Z � x1 � x2 � 3x3 equations.
Subject to 3 x1 � 2 x2 � x3 � 3 x1 � 2 x2 � x3 � 4
2 x1 � x2 � 2 x3 � 2 2 x1 � x2 � 5 x3 � 5
x1 , x2 , x3 � 0.
114. Explain the following terms of an LPP:
1. Solution
110. A company has 3 plants A, B & C, B ware houses
2. Basic Solution
X, Y and Z. The number of units available at the
3. Basic Feasible solution
plants is 60, 70, 80 & the demand at X, Y, Z are
4. Degenerate basic solution
50, 80, 80 respectively.
X Y Z 115. Give the dual of the following LPP:
A 8 7 3 Maximise Z � 2x1 � 3x2 � x3
B 3 8 9 Subject to 4 x1 � 3x2 � x3 � 6
C 11 3 5 x1 � 2 x2 � 3x3 � 4
The unit cost of the transportation is given in the x1 , x2 , x3 � 0
following table find the allocation so that the total
transportation cost is minimum. 116. Find the maximum value of Z � 2x � 3 y subject to
the constraints x � y � 0, x � y � 30, y � 3,
111. Use simplex method to solve the following linear
programming problem 0 � y � 12 and 0 � x � 20 by graphical method.
Maximise: Z � 5x1 � 7 x2
Subject to the constraints. 117. Apply simplex method of solve the following linear
programming
2 x1 � 3x2 � 13
Problem Maximize z � 4 x1 � 3x2
3x1 � 2 x2 � 12
xi � 0; i �1, 2 3x1 � x2 � 15
3 x1 � 4 x2 � 24
112. A company has 3 factories & 4 warehouses. The
production capacities of the factories are 7, 9, 18 x1 � 0, x2 � 0
respectively & the warehouses requirfe 5, 8, 7,
14 respectively. The per unit transportation cost 118. Prove that x1 � 2, x2 � 3, x3 � 2 is a feasible
is given in the matrix below. solution, but not a basic feasible solution, to the
ware house set of constraints.
H1 H 2 H3 H4 Factory x1 � x2 � 2 x3 � 9 , 3 x1 � 2 x2 � 5 x3 , x1 � 0 , x2 � 0 ,
Capacity
x3 � 0
I 19 30 50 40 7
Factory II 70 Also find all basic feasible solutions of the system.
30 40 60 9
III 40 8 70 20 18
119. A company has three factories F1, F2, F3 and three
5 8 7 14 warehouse, w 1 , w 2 , w 3 . The supplies are

transported from the factories to the warehouses. Subject to the constraints

The cost in rupees for transportation of the product 3 x1 � x2 � 2 x3 � 6
from the factories to the warehouses are shown
2 x1 � 5 x2 � x3 � 14
below:
x1 � 4 x2 � 2 x3 � 8
Factory capacity x1 , x2 , x3 � 0
W1 W2 W3
in init
124. Solve the following LPP by graphical method:
F1 8 10 12 900
Maximise Z � 5x1 � 7 x2
F2 12 13 12 1000
F3 14 10 11 1200 Subject to x1 � x2 � 4
Ware house 3x1 � 8 x2 � 24
requirement 1200 100 900 10 x1 � 7 x2 � 35

in units x1 , x2 � 0
Assign factory capacities to warehouse 125. Solve the following LPP by simplex method:
requirements to minimum the cost of Maximize Z � 2 x1 � 5x2 � 7 x3
transportation. Subject to 3x1 � 2 x2 � 4 x3 � 100
120. Using simplex algorithm solve the LPP. x1 � 4 x2 � 2 x3 � 100
Minimise Z � x1 � 3x2 � 2x3 x1 � x2 � 3x3 � 100
Subject to 3 x1 � x2 � 2 x3 � 7 x1 , x2 � x3 � 0
�2 x1 � 4 x2 � 12
126. Solve the following minimal assignment problem
�4 x1 � 3x2 � 8 x3 � 10, x1 � 0, x2 � 0, x3 � 0.
Man 1 2 3 4
121. Find the basic feasible solutions of the following
system of equation in a LPP: I 12 30 21 15
x1 � 2 x2 � x3 � 4 II 18 33 9 31
2 x1 � x2 � 5 x3 � 5
III 44 25 24 21
x j � 0, j � 1, 2,3
IV 23 30 28 14
122. Solve the LPP find min (8 x1 � 6 x2 ) subject to the
constraints 127. Using graphical method
4 x1 � 3x2 � 18 Maximize Z � 40x1 � 100x2
2 x1 � 5 x2 � 16 Subject to 12 x1 � 6 x2 � 3000
x1 , x 2 � 0 4 x1 � 10 x2 � 2000
Using graphical method. Show that more than
2 x1 � 3x2 � 900
one feasible solution. Will field the minimum of
the objective function. Interpret this fact x1 , x2 � 0
geometrically.
128. Solve the following minimum cost assignment
123. Use simplex method to solve the following LPP: problem:
Maximize Z � 2x1 � x2 � 3x3

132. Solve the following linear programming problem

Machines by the simplex method:
M1 M2 M3 M4 Maximize Z � 3x1 � 4 x2 � x3
J1 5 7 11 6 Subject to x1 � 2 x2 � 7 x3 � 8
Jobs J 2 8 5 9 6 x1 � x2 � 2 x3 � 6
J3 4 7 10 7 x1 � x2 � x3 � 0
J4 10 4 8 3
133. ABC Electricals manufactures and sells two
models of lamps, L 1 and L2, the profit per unit
129. Write the dual of the following LPP and hence, being Rs 50 and Rs 30, respectively. The process
solve it by graphical method: involves two workers W 1 and W 2 , who are
Minimize Z � 6 x1 � 4 x2 available for 40 hours and 30 hours per week,
Constraints respectively. W1 assembles each unit of L1 in 30
minutes and that of L2 in 40 minutes. W2 paints
2 x1 � x2 � 1
each unit of L1 in 30 minutes and that of L2 in 15
3x1 � 4x2 �1.5 minutes. Assuming that all lamps made can be
x1 , x 2 � 0 sold, determine the weekly production figures that
maximize the profit.
130. Solve by simplex method, the following LPP:
134. Write the dual of the linear programming problem
Maximise Z � 5x1 � 3x2
Minimize Z � 18 x1 � 9 x2 � 10 x3
Constraints
Subject to
3x1 � 5x2 � 15
x1 � x2 � 2 x3 � 30
5 x1 � 2 x2 � 10
2 x1 � x2 � 15
x1 , x2 � 0
x1 , x2 , x3 � 0
131. A captain of a cricket team has to allot four Solve the dual graphically. Hence obtain the
middle-order batting positions to four batsmen. minimum objective function value of the above
The average number of positions are as follows. LPP.
Assign each batsman his batting position for
maximum performance: 135. Reduce the feasible solution x1 � 2, x2 � 1, x3 � 1
for the linear programming problem
Batting Maximize Z � x1 � 2 x2 � 3x3
position IV V VI VII Subject to x1 � x2 � 3 x3 � 4
Batsman
2 x1 � x2 � x3 � 6
A 40 25 20 35
x1 , x2 , x3 � 0
B 36 30 24 40 to a basic feasible solution it
C 38 30 18 40
136. A steel compnay has three open-hearth furnaces
D 40 23 15 33 and four rolling mills. Transportation costs (rupees
per quintal) for shipping steel from furnaces to
rolling mills are given in the following table:

140. Solve the following Salesman problem :

M1 M2 M3 M4 Supply
(quintals) A B C D
F1 29 40 60 20 7 A � 12 10 15
B 16 � 11 13
F2 80 40 50 70 10
C 17 18 � 20
F3 50 18 80 30 18 D 13 11 18 �
Demand 4 8 8 15
(quintals)
141. x1 = 4, x2 = 1, x3 = 3 is a feasible solution of the
Find the optimal shipping schedule. system of equations
2x1– 3x2 + x3 = 8
137. Solve the following problem by Simplex Method. x1 + 2x2 + 3x3 = 15
How does the optimal table indicate that the Reduce the feasible solution to two different basic
optimal solution obtained is not unique? feasible solutions.
Maximize z � 8x1 � 7 x2 � 2 x3
142. Obtain the initial basic feasible solution for the
subject to the constraints
transportation problem by North-West corner rule:
x1 � 2 x2 � 2 x3 � 12
2 x1 � x2 � 2 x3 � 12 R1 R2 R3 R4 R 5 Supply
x1 , x2 , x3 � 0 F1 1 9 13 36 51 50
Factory F2 24 12 16 20 1 100
138. Find the initial basic feasible solution of the F3 14 35 1 23 26 150
following minimum cost transportation problem 100 70 50 40 40
by Least Cost (Matrix Minima) Method and using
it find the optimal transportation cost:—
Destinations 143. Solve the following LPP graphically:

Maximize Z = 3x1+4x2
D1 D2 D3 D4 Supply Subject to x1 � x2 � 6
S1 5 11 12 13 10 x1 � x2 � 2
Sources S2 8 12 7 8 30
x2 � 4
S3 12 7 15 6 35
x2 , x2 � 0
Requirement 15 15 20 25 Write the dual problem of the above and obtain
the optimal value of the objective function of the
139. Find the optimal assignment cost from the dual without actually solving it.
following cost matrix :
144. Solve graphically
A B C D Maximize z = 7x + 4y
Subject to 2x+y � 2, x+10y � 10 and x � 8.
I 4 5 4 3
(Draw your own graph without graph paper).
II 3 2 2 6
III 4 5 3 5 145. A manufacturer wants to maximise his daily
IV 2 4 2 6 output of bulbs which are made by two processes
P1 and P2. If x1 is the output by process P1 and x2
is the output by process P2, then the total labour

hours is given by 2x1+3x2 and this cannot exceed

130, the total machine time is given by 3x1+8x2
which cannot exceed 300 and the total raw
material is given by 4x1+2x2 and this canot exceed
140. What should x1 and x2 be so that the total
output x1+x2 is maximum? Solve by the simplex
method only.
142. Solve the following transportation problem”
D1 D2 D3 Supply
O1 5 3 6 20
O2 4 7 9 40
Demand 15 22 23 60
��


Institute For Ias/Ifos Examinations: Linear Programming Problem

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Institute For Ias/Ifos Examinations: Linear Programming Problem

Uploaded by

Copyright:

Available Formats

INSTITUTE FOR IAS/IFOS EXAMINATIONS

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

14. Find the dual of the following linear programming

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

� x1 � x2 � 1 24. Write the dual of the following LPP.

D1 D2 D3 D4 D5 Supply 28. Solve the following by simplex method

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

29. Put the following program in standard form.

30. Let x1 = 1, x2 = 1, andand x3 = 1 be a feasible

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

2. Show algebraically that all the basic solutions of x1 � 2 x2 � 8

9. Solve the following by simplex method 3 x1 � 2 x2 � 6

I II III IV 15. Reduce the feasible solution x1 � 2, x2 � 1, x3 � 1 for

12. Solve the Transportation problem, whose unit cost 10 12 4 7 90

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

Hospitals located at H1, H2, H3, H4 & H5. Daily 3 x1 � 8 x2 � 12

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

28. Solve by simplex method

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

1. Find all the basic solutions to the following problem:

2. A company has three plants at locations A, B and

4. A company is spending Rs. 1,000 on transportation z � x1 � 2 x2 � 4 x3

3 x1 � x2 � 5 x3 � 14. 12. Use simplex method, to solve

11. Find the optimum solution to the following x1 � x2 � 2; x1 , x2 � 0

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

35. Write the dual of the following LPP and hence,

41. Obtain an intial basic feasible solution to the

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

52. The following table gives the cost for transporting

50. Solve the following transportation problem

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

Subject to x1 � 2 x2 � x3 � 430 If the cost coefficient of x1 is kept fixed, find the

57. Solve the following LPP: Plant

2 7 3 7 7 5 5 6 and explain the problem of degeneracy.

75. A company has 3 factories A, B and C which 6 1 9 11 12

X Y Z Indicate clearly the rule you apply to arrive at the

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

84. Use the simplex method to solve the problem

86. Solve the following by simplex method 90. Maximize: Z � 3x1 � 5 x2 � 4 x3

87. Find the dual of the following LPP:

F2 3 2 2 4 3 4 40 minimized. The five warehouses must receive 40

89. A paint factory produces both interior and exterior

availability of the products P1, P2, P3 and P4 are

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

Maximize Z = 30x1 + 24x2 customers as possible. Following data have been

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

x1 � 2 x2 � 500 find the all location so that the transportation cost

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

transported from the factories to the warehouses. Subject to the constraints

requirement 1200 100 900 10 x1 � 7 x2 � 35

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

132. Solve the following linear programming problem

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

140. Solve the following Salesman problem :

Destinations 143. Solve the following LPP graphically:

H.O. 25/8 Old Rajender Nagaer Market, Delhi-60

hours is given by 2x1+3x2 and this cannot exceed

142. Solve the following transportation problem”