86

MOST IMPORTANT QUESTIONS

1. Explain the mathematical formulation of a linear programming problem and its matrix
formulation.
2. Define (i) objective function (ii) optimal solution (iii) Surplus variable (iv) Feasible
solution (v) Basic solution.
3. Write the standard form of L.P.P. in matrix form.
4. What is the canonical so run of a L.P.P.?
5. Establish the difference between basic feasible solution and non-degenerate basic
feasible solution.
6. What is the difference between slack variable and surplus variable ?
7. State the general linear programming problem and define (a) feasible solution and (b)
basic feasible solution.
8. Describe simplex method of solving linear programming problem.
9. Explain briefly the term 'Artificial variables'.
10. Explain the use of Artificial variables in LPP.
11. Describe briefly the Big- M method of solving a LPP with artificial variables.
12. Describe briefly the two-phase method of solving a LPP with artificial variables.
13. Explain the disadvantages of Big-M method over Two-Phase Method.
14. How would you resolve the following solutions in a LPP ?
(i) Minimization (ii) Equalities in Constrains (iii) Tie for Leaving Basic Variables.
15. What is degeneracy ? Discuss the method to resolve degeneracy in LPP.
16. Explain how to find the existence of multiple solutions of LPP while solving it by simplex
method.
17. What are the essential characteristics of a linear programming model ? What is an
unbounded solution of a LPP.
18. When does the simplex arithmetic indicate that the LPP has unbounded solution ?
19. What is in feasible solution ? How is it identified in the simplex table ?
20. Discuss the advantages of revised simplex method over the ordinary simplex method.
21. List the steps involved in the Revised simplex method.
22. In what way do you consider the revised simplex method is superior to the usual simplex
method ?
23. Write an algorithm for the bounded variable problem.

EXERCISE
1. Max. Z = 300 X + 400 Y
Subject to 5X +4Y £ 200
3X + 5Y £ 150
5X +4Y £ 100
8X +4Y £ 80
Where X, Y ³ 0 (Ans. X = 0, Y = 20. Max. Z = 8000)
 87

2. Max. Z = 5 X 1 + 3 X 2
Subject to 3 X 1 + 5 X 2 £ 15
5 X 1 + 2 X 2 £ 10
20 45 235
Where X1 , X 2 ³ 0 (Ans. X 1 = , X2 = , Max. Z = )
19 19 19
3. Max. Z = 5x 1 + 3x 2
Subject to x1 + x 2 £ 6
2x 1 + 3x 2 £ 3
x1 £ 3
x2 £ 3
3 15
Where x1 , x 2 ³ 0 (Ans. x 1 = , x 2 = 0, Max. Z = )
2 2
4. Max. Z = 5 X 1 + 3 X 2
Subject to X1 + X 2 £ 2
5 X1 + 2 X 2 £ 10
3 X1 + 8 X 2 £ 12
Where X1 , X 2 ³ 0 (Ans. X 1 = 2, X 2 = 0, Max. Z = 10)
7 1
5. Maximize Z = X1 + X2
100 10
Subject to X1 + X 2 £ 30,000
X1 ³ 6,000
X2 £ 12,000
X1 - X 2 ³ 0
X1 , X 2 ³ 0 (Ans. X 1 = 18,000, X 2 = 12,000, Max Z = 2,460)
6. The products A, B and C are produced in three machine centres X , Y and Z. Each product
involves operations on each of the machine centres. The time required for each operation
for unit amount of each product is given below :
Machine Centres
X Y Z
A 10 7 2
Products B 2 3 4
C 1 2 1
Time in (Hrs.)
There are 100, 77 and 80 hours available at machine centres X , Y and Z respectively.
The profit per unit of A, B and C is Rs. 12, Rs. 3 and Re. 1 respectively.
Formulate the problem as LPP (Linear Programming Problem) and find the profit
981 73 35
maximising product mix. (Ans. Max. Z = ; X1 = ; X2 = )
8 8 8
 88

7. XYZ company has three departments assembly, painting and packaging with the
capability of making three types of alimirahs. An almirah of type I requires one hour of
assembly, 40 minutes of painting and 20 minutes of packaging time respectively. Semi
almirah type II needs 80 min; 20 min and one hour resp.; the last type requires 40
minutes each of assembly, painting & packaging time. The total time available at
assembly, painting and packaging departments are 600 hours, 400 hours and 800 hours
resp. Determine the numbers of each type of almirahs that should be produced in order to
maximise the profits. The unit profits for types I, II and III are Re. 40, Re. 80 and Re. 60
resp. (Ans. X 1 = 0, X 2 = 200, X 3 = 500, Max. Z = 46,000)
8. A factory engaged in the manufacturing of pistons rings and values for which the profits
per unit are Rs. 10, 6 and 4 respectively wants to decide the most profitable mix. It takes
one hour of preparatory work, 10 hour of machining and two hours of packing
requirements for rings and values are 1, 4 & 2 and 1, 5 & 6 hours respectively. The total
no. of hours available for preparatory work, machining and packing & allied formalities
are 100, 600 and 300 respectively. Determine the most profitable mix assuming that
what all produced can be sold. 100 200 2,200
(Ans. X = ,Y= , Z = 0, Max. Z = )
3 3 3
9. An ol car dealer wishes to stock up his lot to maximise his profits. He can select cars A, B
and C which are valued at wholesale at Rs. 5,000, Rs. 7,000 and Rs. 8,000 respectively.
These can be sold at Rs. 6,000, Rs. 8,500 and Rs. 10,500 respectively. For each car type
the probabilities of sale are :
Type of Car Probability of Sale in 90 days
A 0.7
B 0.8
C 0.6
For every two cars of type B, he should buy one car of type A or C. If he has Rs. 100000 to
invest, what should he buy to maximise his expected gains ? Formulate the linear
programming problem & solve it. 25
(Ans. X 1 = 20, X 2 = 0, X 3 = , Max. Z = 32,750)
2
10. A company is engaged in producing three products viz. A, B, C the following data are
available :
Products A B C
Sale Price (per unit) 10 12 15
Cost (per unit) 6 9 10

The wholesaler who is responsible for selling to the customer is to be paid Rs. 150 per day
respective of the quantities sold of each of the product.
The products are processed in three different operations. The time (hours) required to
produce are product in each of the operations and the daily capacity (hrs.) available for
each operation centre are given next :
 89

Products
Operations Daily Capacity
A B C
1 2 3 2 400
2 3 2 2 350
3 1 1 2 300

What product would yield maximum profit and how much.

275 1,575
(Ans. X 1 = 25, X 2 = 0, X 3 = , Max. Z = )
2 2