PREVIOUS YEAR QUESTION BANK

EXADEMY
Mathematics Optional Free Courses for UPSC and all State PCS

You Tube Channel WhatsApp - +91-7381987177

Telegram Channel: EXADEMY OFFICIAL

LINEAR PROGRAMMING
Q1. The following table gives the cost for transporting material from supply points A, B, C,
D to demand points E, F, G, H, J:

The present allocation is as follows:

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.

i. Check if this allocation is optimum. If not, find an optimum schedule.

ii. If in the above problem the transportation cost from A to G is reduce to 10, what
will be the new optimum schedule?

E F G H J

A 8 10 12 17 15

B 15 13 18 11 9

C 14 20 6 10 13

D 13 19 7 5 12

(Year 1992)

(20 Marks)
Q2. Solve the following linear programming problem

Maximize Z = 3x₁ + 2x₂

Subjected to

x₁ + x₂ ≤ 7

x₁ - x₂ ≤ 2

x₁, x₂ ≥ 0

(Year 1992)

(20 Marks)

Q3. A departmental Head has four subordinates and four tasks are to be performed. The
subordinates differ in efficiency and the tasks differ in their intrinsic difficulty. His estimates of the times
each man would take to perform each task is given in the effectiveness matrix below. How should the
tasks be allocated one to one man, so as to minimize the total man hours?

(Year 1993)

(20 Marks)
Q4. Use Simplex method to solve:

Maximize xₒ = x₁ - 3x₂ + 2x₃

Subjected to

3x₁ - x₂ + 2x₃ ≤ 7

-2x₁ + 4x₂ ≤ 12

-4x₁ + 3x₂ + 8x₃ ≤ 10

x₁, x₂, x₃ ≤ 0

(Year 1993)

(20 Marks)

Q5. Consider the following Data: The cost of shipment from third source to the third
destination is not known. How many units should be transported from the sources to the
destinations so that the total cost of transporting all the units to their destinations is a minimum?

Destination

1 2 3 Capacities

1 2 2 3 10
Source

2 4 1 2 15

3 1 3 x 40

Demands 20 15 30

(Year 1994)

(20 Marks)
Q6. Use Simplex method to solve:

Maximize Z = 3x₁ + 2x₂ + 5x₃

Subjected to

x₁ + 2x₂ + x₃ ≤ 430

3x₁ + 2x₂ ≤ 460

x₁ + 4x₂ ≤ 420

x₁, x₂, x₃ ≥ 0

(Year 1994)

(20 Marks)

Q7. There are five jobs each of which must go through two machines A and B in the order A,
B. Processing times are given below: Determine a sequence for the jobs that will minimize the
elapsed time. Compute the total idle times for the machines in this period.

Job 1 2 3 4 5

Time for A (in hours) 7 3 11 5 12

Time for B (in hours) 4 8 9 10 6

(Year 1995)

(20 Marks)
Q8. Solve the transportation problem below for minimizing the cost:

(Year 1995)

(20 Marks)

Q9. Solve the following linear programming problem

Maximize z = x₁ + 2x₂ + 3x₃ - x₄

Subjected to the constraints

x₁ + 2x₂ + 3x₃ = 15

2x₁ + x₂ + 5x₃ = 20

x₁ + 2x₂ + x₃ + x₄ = 10

x₁, x₂, x₃, x₄ ≥ 0

(Year 1995)

(20 Marks)
 Q10. Determine the optimal sequence of jobs that minimizes the total elapsed time
required to complete the following jobs and find the total elapsed time. The jobs are to be
processed on three machines M₁, M₂, M₃ in the same order M₁, M₂, M₃ and processing times
are as below: Find also the idle times for the three machines.

Jobs A B C D E F G

M₁ 3 8 7 4 9 8 7

M₂ 4 3 2 5 1 4 3

M₃ 6 7 5 11 5 6 12

(Year 1996)

Q11. Determine the

Maximum Z = P1P2….Pn

Subject to constraints
𝑛

∑ ci pi ≤ x, 0 ≤ pi ≤ 1 (I = 1, 2, … n)
𝑖−1

Assume that ci > x for all i

(Year 1996)
Q12. A company has four plants P₁, P₂, P₃, P₄ from which it supplies to three markets M₁, M₂,
M₃. Determine the optimal transportation plan using MODI method from the following data
giving the plant to market shifting costs, quantities available at each plant an quantities required
at each market:

(Year 1996)

(20 Marks)

Q13. A tax consulting firm has 4 service stations (counters) in its office to receive
people who have problems and complaints about their income, wealth etc. The number of
arrivals averages 80 persons in an eight hour service day. Each tax adviser spends an
irregular amount average service time is 20 minutes. Calculate the average number of people
waiting to be serviced, average time a person spends in the system and the average waiting
time for a person. What is the expected number of idle tax adviser at any specified time?

(Year 1996)

(20 Marks)
Q14. Solve the assignment problem represented by the following for minimizations of
costs. Find also alternate solutions if any.

(Year 1996)

(20 Marks)

Q15. Use the simplex method to solve the following Linear Programming Problem:

Maximize z = 3x₁ + 5x₂

Subjected to

x₁ ≤ 4

x₂ ≤ 6

3x₁ + 2x₂ ≤ 18

x₁, x₂ ≤ 0

(Year 1996)

(20 Marks)
 Q16. In factory, there are six jobs to perform and each should go through two machines
A and B in the order A, B. The processing timings (in hours) for the jobs are given below.
Determine the sequence form performing the jobs that would minimize the total elapsed time
T. What is the value of T?

Jobs

J₁ J₂ J₃ J₄ J₅ J₆

A 1 3 8 5 6 3

B 5 6 3 2 2 10

(Year 1997)

(20 Marks)

Q17. Use the simplex method to solve the following Linear Programming Problem:

Maximize z = 4x₁ + 10x₂

Subjected to

2x₁ + x₂ ≤ 50

2x₁ + 5x₂ ≤ 100

2x₁ + 3x₂ ≤ 90

x₁, x₂ ≥ 0

(Year 1997)

(20 Marks)
Q18. State the Transportation problem in general terms and explain the problem of degeneracy.

(Year 1997)

(20 Marks)

Q19. A book binder processes the manuscript of 5 books through the three stages of operation,
viz., printing, binding and finishing. The time required to perform the printing, binding and
finishing operations are given below:

(Year 1998)

(20 Marks)
Q20. A bank has two tellers working on savings accounts. The first teller handles withdrawals
only. The second teller handles depositors only. It has been found that the service time
distributions of both deposits and withdrawals are exponential with a mean service time of 3
minutes per customer. Depositors and withdrawers are found to arrive in a Poisson fashion
throughout the day with mean arrival rate of 16 and 14 per hour. What would be the effect on the
average waiting time for depositors and withdrawers if each teller could handle both the
withdrawals and deposits? What would be the effect if this could only be accomplished by
increasing the service time to 3.5 minutes?

(Year 1998)

(20 Marks)

Q21. Solve the unbalanced assignment problem in minimization where, C(ij) =

12 10 15 22 18 8

10 18 25 15 16 12

11 10 3 8 5 9

6 14 10 13 13 12

8 12 11 7 13 10

(Year 1998)

(20 Marks)
Q22. Prove that a basic feasible solution to a linear programming problem must correspond to
an extreme point of the set of all feasible solutions.

(Year 1998)

(20 Marks)

Q23. Give the economic interpretation of duality in linear programming.

(Year 1999)

(20 Marks)
Q24. Find the optimal assignment for the given assignment costs:

(Year 1999)

(20 Marks)

Q25. Develop mathematical model of a balanced transportation problem. Prove that it always
has a feasible solution.

(Year 1999)

(20 Marks)
Q26. Respond True or False to the following, justify your answer in case of False:

1. If the number of primal variables is much smaller than the number of constraints,
it is more efficient to obtain the solution of the primal by solving its dual,

2. When the primal problem is non-optimal, the dual problem is automatically

3. An unrestricted primal variable will have the effect of yielding an equality dual
constraint.

4. If the solution space is unbounded, the objective value will always be unbounded.

5. The selection of the entering variable from among the current non-basic variable
as the one with the most negative objective coefficient guarantees the most
increase in the objective value in the next iteration.

6. In the simplex method, the feasibility conditions for the maximization and
minimization problems are different.

7. A simplex iteration (basic solution) may no necessarily coincide with a feasible

8. If the leaving variable does not correspond to the minimum ratio, at least one
basic variable will definitely become negative in the next iteration.

(Year 1999)

(20 Marks)

Q27. Show that a problem in the theory of games can be expressed as a linear programming
problem.

(Year 1999)

(20 Marks)
Q28. A police department has the following minimal daily requirements from police officers
during its six shift periods:-

Minimal Number
Time of Day Period
Required

2 am – 6 am 1 22

6 am – 10 am 2 55

10 am – 2 pm 3 88

2 pm – 6 pm 4 110

6 pm – 10 pm 5 44

10 pm – 2 am 6 33

An officer must start at the beginning of 4 – hour shift and stay on duty for two consecutive
shifts (an 8 hour tour). Any one starting during period 6 stays on duty during period 1 of the next
day. The objective of the police department is to always have on duty the minimal number
required in a period but to do so with the least number of officers. Develop the corresponding
liner programming model.

(Year 1999)

(20 Marks)
Q29. Solve the following assignment problem for the given assignment costs:

I II III IV V

1 11 17 8 16 20

2 9 7 12 6 15

3 13 16 15 12 16

4 21 24 17 28 26

5 14 10 12 11 13

(Year 2000)

(20 Marks)

Q30. Two unbiased coins are tossed once (independently) and the number X of heads that
turned up is noted. A number is selected at random from X, X + 1 and X + 2. If Y is the number
selected, find the joint of distribution of X and Y. Also obtain the expectation of XY.

(Year 2000)

(20 Marks)
Q31. An explosion in a factory manufacturing explosives can occur because of

1. Leakage of electricity,

2. Defects in machinery,

3. Carelessness of workers or

4. Sabotage.

The probability that there is a leakage of electricity is 0.20, the machinery is defective is 0.30,
the workers are careless is 0.40, there is sabotage is 0.10. The engineers feel that an explosion
can occur with probability

I. 0.25 because of leakage of electricity

II. 0.20 because of defects in machinery,

III. 0.50 because of carelessness of workers and

IV. 0.75 because of sabotage.

Determine the most likely cause of explosion.

(Year 2000)

(20 Marks)

Q32. A manufacturer has distribution centers at Delhi, Kolkata and Chennai. These centers
have available 30, 50 and 70 units of his product. His four retail outlets require the following
number of units: A, 30; B, 20; C, 60; D, 40. The transportation cost per unit in rupees between
each center and outlet is given in the following table: Determine the minimum transportation
cost.

(Year 2001)

(20 Marks)
Q33. Using duality or otherwise solve the linear programming problem

Maximize z = 18x₁ + 12x₂

Subjected to

2x₁ - 2x₂ ≥ -3

3x₁ + 2x₂ ≥ 3

x₁, x₂ ≥ 0

(Year 2001)

(12 Marks)

Q34. Compute all basic feasible solutions of the linear programming problem:

Maximize z = 2x₁ + 3x₂ + 2x₃

Subjected to

2x₁ + 3x₂ - x₃ = 8

x₁ - 2x₂ + 6x₃ = -3

x₁, x₂, x₃ ≥ 0

Hence indicate the optimal solution.

(Year 2001)

(12 Marks)
Q35. A company has 3 factories A, B and C which supply units to warehouses X, Y and Z.
Every month the capacities of the factories per month are 60, 70 and 80 units. A, B and C
respectively. The requirements of X, Y and Z are 50, 80 and 80 respectively. The necessary data
in terms of unit transportation cost in rupees, factory capacities and warehouse requirements are
given below:

Find the minimum distribution cost.

(Year 2002)

(15 Marks)

Q36. Use the simplex method to solve the linear programming problem:

Maximize z = 5x₁ + 3x₂

Subjected to

x₁ + x₂ ≤ 2

5x₁ + 2x₂ ≤ 10

3x₁ + 8x₂ ≤ 12

x₁, x₂ ≥ 0

(Year 2002)

(15 Marks)
Q38. Find the optimal solution for the assignment problem with the following cost matrix:

Indicate clearly the rule you apply to arrive at the complete assignment.

6 1 9 11 12

2 8 17 2 5

11 8 3 3 3

4 10 8 6 11

8 10 11 5 13

(Year 2003)

(15 Marks)

Q39. An animal feed company must produce 200 kg of a mixture consisting of ingredients X₁ and X₂
daily. X₁ costs Rs. 3 per kg and X₂ costs Rs. 8 per kg. No more than 80 kg of X₁ can be used, and at least
60 kg of X₂ must be used. Formulate a linear programming model of the problem and use Simplex
method to determine the ingredients X₁ and X₂ to be used to minimize cost.

(Year 2003)

(15 Marks)
Q40. For the following system of equations

x₁ + x₂ + x₃ = 3

2x₁ - x₂ + 3x₃ = 4

Determine:

I. All basic solutions

II. All basic feasible solutions

III. A feasible solution which is not a basic feasible solution.

(Year 2003)

(15 Marks)

Q41. A department has 4 technicians and 4 tasks are to be performed. The technicians differ in
efficiency and tasks differ in their intrinsic difficulty. The estimate of time (in hours), each
technician would take to perform a task is given below. How should the task be allotted, one to a
technician, so as to minimize the total work hours?

(Year 2004)

(15 Marks)
Q42. A travelling salesman has to visit 5 cities. He wishes to start from a particular city, visit
each city once and then return to his starting point. Cost of going from one city to another is
given below: You are required to find the least cost route.

(Year 2004)

(15 Marks)

Q43. Use the simplex method to solve the linear programming problem:

Maximize z = 3x₁ + 2x₂

Subjected to

x₁ + x₂ ≤ 4

x₁ - x₂ ≤ 2

x₁, x₂ ≥ 0

(Year 2004)

(12 Marks)
Q44. Use the simplex method to solve the problem:

Maximize z = 5x₁ + 2x₂

Subjected to

6x₁ + x₂ ≥ 6

4x₁ + 3x₂ ≥ 12

x₁ + 2x₂ ≥ 4

x₁, x₂ ≥ 0

(Year 2005)

(30 Marks)

Q45. Put the following program in standard form:

Maximize z = 25x₁ + 30x₂

Subjected to

4x₁ + 7x₂ ≥ 1

8x₁ + 5x₂ ≥ 3

6 x₁ + 9x₂ ≥ -2

x₁, x₂ ≥ 0

(Year 2005)

(12 Marks)
Q46. Use the simplex method to solve the problem

Maximize: u = 2x + 3y

Subject to

-2x + 3y ≤ 2

3x + 2y ≤ 5

x, y ≥ 0

(Year 2006)

(30 Marks)

Q47. Use the simplex method to solve the problem

Maximize: u = 5x + 2y

Subject to

x + 3y ≤ 12

3x - 4y ≤ 9

7x + 8y ≤ 20

x, y ≥ 0

(Year 2006)

(12 Marks)
Q48. Solve the following by Simplex method:

Maximize: u = 4x + 3y

Subject to

x+y≤1

x - 2y ≤ 4

x, y ≥ 0

(Year 2007)

(30 Marks)

Q49. Put the following in slack form and describe which of the variables are 0 at each of the
vertices of the constraint set and hence determine the vertices algebraically:

Maximize: Z = 4x + 3y

Subject to

x+y≤4

-x + y ≤ 2

x, y ≥ 0

(Year 2007)

(12 Marks)
Q50. Solve the following transportation problem: by finding the initial solution by Matrix
Minima Method (F – Factories, D – Destinations)

D₁ D₂ D₃ D₄ D₅ D₆ Availability

F₁ 2 1 3 3 2 5 50

F₂ 3 2 2 4 3 4 40

F₃ 3 5 4 2 4 1 60

F₄ 4 2 2 1 2 2 30

Demand 30 50 20 40 30 10 180

(Year 2008)

(30 Marks)

Q51. Find the dual of the following linear programming problem:

Maximize z = 2x₁ - x₂ + x₃

Subjected to

x₁ + x₂ - 3x₃ ≤ 8

4x₁ - x₂ + x₃ = 2

2x₁ + 3x₂ - x₃ ≥ 5

x₁, x₂, x₃ ≥ 0

(Year 2008)

(12 Marks)
Q52. Solve the following linear programming problem:

Maximize z = 3x₁ + 5x₂ + 4x₃

Subjected to

2x₁ + 3x₂ ≤ 8

3x₁ + 2x₂ + 4x₃ ≤ 15

2x₂ + 5x₃ ≤ 10

x₁, x₂, x₃ ≥ 0

(Year 2008)

(30 Marks)

Q53. A paint factory produces both interior and exterior paint from two raw materials M₁ and
M₂. The basic data is as follows:

A market survey indicates that the daily demand interior paint cannot exceed that of the exterior
paint by more than 1 ton. The maximum daily demand of interior paint in 2 tons. The factory
wants to determine the optimum product mix of interior and exterior paint that maximizes daily
profits. Formulate the LP problem for this situation.

(Year 2009)

(12 Marks)
Q54. Determine the optimal transportation programme so that the transportation cost of 340
tons of a certain type of material from three factories to five warehouses W₁, W₂, W₃, W₄ & W₅
is minimized. The five warehouses must receive 40 tons, 50 tons, 70 tons, 90tons and 90 tons
respectively. The availability of the material F₁, F₂, F₃ is 100 tons, 120 tons, 120 tons
respectively. The transportation costs per ton from factories to warehouses are given in the table
below. Use Vogel’s approximation method to determine the basic feasible solution.

W₁ W₂ W₃ W₄ W₅

F₁ 4 1 2 6 9

F₂ 6 4 3 5 7

F₃ 5 2 6 4 8

(Year 2010)

(30 Marks)

Q55. Construct the dual of the primal problem:

Maximize z = 2x₁ + x₂ + x₃

Subjected to

x₁ + x₂ + x₃ ≥ 6

3x₁ - 2x₂ + 3x₃ = 3

-4x₁ + 3x₂ - 6x₃ = 1

x₁, x₂, x₃ ≥ 0

(Year 2010)

(12 Marks)
Q56. Solve by Simplex method the following LP problem:

Maximize z = 5x₁ + x₂

Subjected to

3x₁ + 5x₂ ≤ 15

5x₁ + 2x₂ ≤ 10

x₁, x₂ ≥ 0

(Year 2011)

(12 Marks)

Q57. Write down the dual of the following LP problem and hence solve it by graphical
method:

Minimize z = 6x₁ + 4x₂

Subjected to

2x₁ + x₂ ≥ 1

3x₁ + 4x₂ ≥ 1.5

x₁, x₂ ≥ 0

(Year 2011)

(20 Marks)
Q58. For each hour per day that Ashok studies mathematics, it yields him 10 marks and for
each hour that he studies physics, it yields him 5 marks. He can study at most 14 hours a day and
he must get at least 40 marks in each. Determine graphically how many hours a day he should
study mathematics and physics each in order to maximize his marks?

(Year 2012)

(12 Marks)

Q59. By the method of Vogel, determine an initial basic feasible solution for the following
transportation problem: Products P₁, P₂, P₃ & P₄ have to be sent of destinations D₁, D₂ & D₃. The
cost of sending product P(i) to destinations D(j) is C(ij) where the matrix is:

The total requirements of destinations D₁, D₂ & D₃ are given by 45, 45, 95 respectively and the
availability of the products P₁, P₂, P₃ & P₄ are respectively 25, 35, 55 and 70.

(Year 2012)

(12 Marks)
Q60. Solve the following linear programming problem

Maximize z = 5x₁ - 4x₂ + 6x₃ - 8x₄

Subjected to the constraints

x₁ + 2x₂ - 2x₃ + 4x₄ ≤ 40

2x₁ - x₂ + x₃ + 2x₄ ≤ 8

4x₁ - 2x₂ + x₃ - x₄ ≤ 10

x₁, x₂, x₃, x₄ ≥ 0

(Year 2013)

(20 Marks)

Q61. Solve the minimum time assignment problem

M₁ M₂ M₃ M₄

J₁ 3 12 5 14

J₂ 7 9 8 12

J₃ 5 11 10 12

J₄ 6 14 4 11

(Year 2013)

(15 Marks)
Q62. Solve the following linear programming problem:

Maximize z = 2x₁ + 3x₂ - 5x₃

Subjected to

x₁ + x₂ + x₃ = 7

2x₁ - 5x₂ + x₃ ≥ 10

x₁, x₂, x₃ ≥ 0

(Year 2013)

(10 Marks)

Q63. Find all optimal solutions of the following linear programming problem by the simplex
method.

Maximize z = 30x₁ + 24x₂

Subjected to

5x₁ + 4x₂ ≤ 200

x₁ ≤ 32

x₂ ≤ 40

x₁, x₂ ≥ 0

(Year 2014)

(20 Marks)
Q64. Find the initial basic feasible solution of the following transportation problem using
Vogel’s approximation method and find the cost. ( O – Origins, D – Destinations)

D₁ D₂ D₃ D₄ Supply

O₁ 6 4 1 5 14

O₂ 8 9 2 7 16

O₃ 4 3 6 2 5

Demand 6 10 15 4

(Year 2014)

(20 Marks)

Q65. Solve graphically

Maximize z = 6x₁ + 5x₂

Subjected to

2x₁ + x₂ ≤ 16

x₁ + x₂ ≤ 11

x₁ + 2x₂ ≥ 6

5x₁ + 6x₂ ≤ 90

(Year 2014)

(20 Marks)
Q66. Solve the following linear programming problem by the simplex method. Write its dual.
Also, write the optimal solution of the dual from the optimal table of the given problem:

Maximize z = 2x₁ - 4x₂ + 5x₃

Subjected to

x₁ + 4x₂ - 2x₃ ≤ 2

-x₁ + 2x₂ + 3x₃ ≤ 1

x₁, x₂, x₃ ≥ 0

(Year 2015)

(20 Marks)

Q67. Consider the following linear problem

Maximize z = x₁ + 2x₂ - 3x₃ + 4x₄

Subjected to

x₁ + x₂ + 2x₃ + 3x₄ = 12

x₂ + 2x₃ + x₄ = 8

x₁, x₂, x₃, x₄ ≥ 0

1. Using the definition, find its all basic solutions. Which of these are degenerate
basic feasible solutions and which are non-degenerate basic feasible solutions ?

2. Without solving the problem, show that it has an optimal solution and which of
the basic feasible solution(s) is/are optimal ?

(Year 2015)

(20 Marks)
Q68. Solve the following assignment problem to maximize the sales.

X axis:
Territories
I II III IV V
Y axis:
Salesmen

A 3 4 5 6 7

B 4 15 13 7 6

C 6 13 12 5 11

D 7 12 15 8 5

E 8 13 10 6 9

(Year 2015)

(10 Marks)

Q69. Maximize z = 2x₁ + 3x₂ + 6x₃

Subjected to

2x₁ + x₂ + x₃ ≤ 5

3x₂ + 2x₃ ≤ 6

x₁, x₂, x₃ ≥ 0

Is the optimal solution unique? Justify your answer..!

(Year 2016)

(20 Marks)
Q70. Using graphical method, find the maximum values of (5x + 2y) subject to

x + 2y ≥ 1

2x + y ≤ 1

x, y ≥ 0

(Year 2016)

(10 Marks)

Q71. Find the initial basic feasible solution of the following transportation problem using
Vogel’s approximation method and find the cost. ( O – Origin, D – Destination)

D₁ D₂ D₃ D₄ D₅

O₁ 4 7 0 3 6 14

O₂ 1 2 -3 3 8 9

O₃ 3 -1 4 0 5 17

8 3 8 13 8

(Year 2017)

(15 Marks)
Q72. Solve the following linear programming problem by simplex method:

Maximize z = 3x₁ + 5x₂ + 4x₃

Subject to

2x₁ + 3x₂ ≤ 8

2x₂ + 5x₃ ≤ 10

3x₁ + 2x₂ + 4x₃ ≤ 15

x₁, x₂, x₃ ≥ 0

(Year 2017)

(20 Marks)

Q73. Using graphical method, find the maximum values of (2x + y) subject to

4x + 3y ≤ 12

4x + y ≤ 8

4x - y ≤ 8

x, y ≥ 0

(Year 2017)

(10 Marks)
Q74. An agriculture firm has 180 tons of nitrogen fertilizer, 250 tons of phosphate and 220
tons of potash. It will be able to sell a mixture of these substances in their respective ratio 3:3:4
at a profit of Rs. 1500 per ton and a mixture in the ratio 2:4:2 at a profit of Rs. 1200 per ton. Pose
a linear programming problem to show how many tons of these two mixtures should be prepared
to obtain the maximum profit.

(Year 2018)

(10 Marks)

Q75. Solve the following linear programming problem by Big-M method and show that the
problem has finite optimal solutions. Also find the value of the objective function:

Minimize: z = 3x₁ + 5x₂

Subject to

x₁ + 2x₂ ≥ 8

3x₁ + 2x₂ ≥ 12

5x₁ + 6x₂ ≤ 60

x₁, x₂ ≥ 0

(Year 2018)

(20 Marks)
Q76. In a factory there are five operators O₁, O₂, O₃, O₄, O₅ and five machines M₁, M₂, M₃, M₄,
M₅. The operating costs are given when Oi operator operates the Mj machine (I, j = 1, 2, …. 5).
But there is a restriction that O₃ cannot be allowed to operate the third machine M3 and O2
cannot be allowed to operate the fifth machine M5. The cost matrix is given above. Find the
optimal assignment and the optimal assignment cost also.

(Year 2018)

(15 Marks)

Q77. Solve the following linear programming problem by Graphical method:

Minimize: z = 3x₁ + 2x₂

Subject to

x₁ - x₂ ≥ 1

x₁ + x3 ≥ 3

x₁, x₂, x3 ≥ 0

(Year 2019)

(10 Marks)
Q78. Consider the following linear programming problem

Maximize z = x₁ + 2x₂ - 3x₃ - 2x₄

Subjected to

x₁ + 2x₂ - 3x₃ + x₄ = 4

x₁ + 2x₂ + x₃ + 2x₄ = 4

x₁, x₂, x₃, x₄ ≥ 0

(Year 2019)

(15 Marks)

Q79. Consider the following linear programming problem

Maximize z = 2x₁ + 4x₂ + 4x₃ - 3x₄

Subjected to

x₁ + x₂ + x₃ = 4

x₁ + 4x₂ + x₄ = 8

x₁, x₂, x₃, x₄ ≥ 0

Use the dual problem to verify that the basic solution (x1, x2) is not optimal.

(Year 2019)

(10 Marks)
 CIVIL SERVICES
PREVIOUS YEAR QUESTIONS
SEGMENT- WISE

LINEAR PROGRAMMING
1. Use two-phase method to solve the following linear programming problem:
Minimize 𝒁 = 𝒙𝟏 + 𝒙𝟐
subject to
𝟐𝒙𝟏 + 𝒙𝟐 ≥ 𝟒
𝒙𝟏 + 𝟕𝒙𝟐 ≥ 𝟕 [2022][10]
𝒙𝟏 , 𝒙𝟐 ≥ 𝟎
2. Solve the following linear programming problem by the simplex method. Write its
dual. Also, write the optimal solution of the dual from the optimal table of the given
problem:
Maximize 𝒁 = 𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑
subject to
𝟐𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑 ≤ 𝟐
𝟒𝒙𝟏 + 𝟐𝒙𝟐 + 𝒙𝟑 ≤ 𝟐
𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 ≥ 𝟎 [2022][15]
3. Find the initial basic feasible solution of the following transportation problem by
Vogel’s approximation method and use it to find the optimal solution and the
transportation cost of the problem:
𝑫𝒆𝒔𝒕𝒊𝒏𝒂𝒕𝒊𝒐𝒏
𝑨 𝑩 𝑪 𝑫
𝑺𝟏 𝟐𝟏 𝟏𝟔 𝟐𝟓 𝟏𝟑 𝟏𝟏
Source 𝑺𝟐 𝟏𝟕 𝟏𝟖 𝟏𝟒 𝟐𝟑 𝟏𝟑 𝑨𝒗𝒂𝒊𝒍𝒂𝒃𝒊𝒍𝒊𝒕𝒚
𝑺𝟑 𝟑𝟐 𝟐𝟕 𝟏𝟖 𝟒𝟏 𝟏𝟗
Requirement 𝟔 𝟏𝟎 𝟏𝟐 𝟏𝟓 𝟒𝟑 [2022][20]
4. A department of a company has five employees with five jobs to be performed. The
time (in hours) that each man takes to perform each job is given in the effectiveness
matrix. Assign all the jobs to these five employees to minimize the total processing
time:
𝑬𝒎𝒑𝒍𝒐𝒚𝒆𝒆𝒔
Ⅰ Ⅱ Ⅲ Ⅳ Ⅴ
𝑨 10 5 13 15 16
𝑩 3 9 18 13 6
𝑱𝒐𝒃𝒔 𝑪 10 7 2 2 2
𝑫 7 11 9 7 12
𝑬 7 9 10 4 12
[2021][10]
5. Convert the following LPP into dual LPP:
Minimize 𝒁 = 𝒙𝟏 − 𝟑𝒙𝟐 − 𝟐𝒙𝟑
subject to
𝟑𝒙𝟏 − 𝒙𝟐 + 𝟐𝒙𝟑 ≤ 𝟕
𝟐𝒙𝟏 − 𝟒𝒙𝟐 ≥ 𝟏𝟐
−𝟒𝒙𝟏 + 𝟑𝒙𝟐 + 𝟖𝒙𝟑 = 𝟏𝟎
where 𝒙𝟏 , 𝒙𝟐 ≥ 𝟎 and 𝒙𝟑 is unrestricted in sign. [2021][15]
6. Solve the following linear programming problem using Big 𝑴 method:
Maximize 𝒛 = 𝟒𝒙𝟏 + 𝟓𝒙𝟐 + 𝟐𝒙𝟑
subject to
𝟐𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑 ≥ 𝟏𝟎
𝒙𝟏 + 𝟑𝒙𝟐 + 𝒙𝟑 ≤ 𝟏𝟐
[2021][15]
𝒙𝟏 + 𝒙𝟐 + 𝒙𝟑 = 𝟔
𝒙𝟏 , 𝒙𝟐 , 𝒙𝟑 ≥ 𝟎
7. UPSC maintenance section has purchased sufficient number of curtain cloth pieces
to meet the curtain requirement of its building. The length of each piece is 𝟏𝟕 feet.
The requirement according to curtain length is as follows:
𝑪𝒖𝒓𝒕𝒂𝒊𝒏 𝒍𝒆𝒏𝒈𝒕𝒉(𝒊𝒏 𝒇𝒆𝒆𝒕) 𝑵𝒖𝒎𝒃𝒆𝒓 𝒓𝒆𝒒𝒖𝒊𝒓𝒆𝒅
𝟓 𝟕𝟎𝟎
𝟗 𝟒𝟎𝟎
𝟕 𝟑𝟎𝟎
The width of all curtains is same as that of available pieces. From a linear
programming problem in standard form that decides the number of pieces cut in
different ways so that the total trim loss is minimum. Also give a basic feasible solution
to it. [2020][10]
8. Solve the linear programming problem using simplex method:
Minimize 𝒛 = −𝟔𝒙𝟏 − 𝟐𝒙𝟐 − 𝟓𝒙𝟑
subject to 𝟐𝒙𝟏 − 𝟑𝒙𝟐 + 𝒙𝟑 ⩽ 𝟏𝟒
−𝟒𝒙𝟏 + 𝟒𝒙𝟐 + 𝟏𝟎𝒙𝟑 ⩽ 𝟒𝟔
[2020][15]
𝟐𝒙𝟏 + 𝟐𝒙𝟐 − 𝟒𝒙𝟑 ⩽ 𝟑𝟕
𝒙𝟏 ⩾ 𝟐, 𝒙𝟐 ⩾ 𝟏, 𝒙𝟑 ⩾ 𝟑

9. Find the initial basic feasible solution of the following transportation problem by
Vogel’s approximation method and use it to find the optimal solution and the
transportation cost of the problem.
𝑫𝒆𝒔𝒕𝒊𝒏𝒂𝒕𝒊𝒐𝒏𝒔
𝑫𝟏 𝑫𝟐 𝑫𝟑 𝑫𝟒
10 0 20 11 15
𝑺𝟏
𝑺𝒐𝒖𝒓𝒄𝒆𝒔 𝑺𝟐 12 8 9 20 25 𝑨𝒗𝒂𝒊𝒍𝒂𝒃𝒊𝒍𝒊𝒕𝒚
𝑺𝟑 0 14 16 18 10
5 20 15 10
[2020][20]
𝑫𝒆𝒎𝒂𝒏𝒅