KUMARAGURU COLLEGE OF TECHNOLOGY, COIMBATORE 06

DEPARTMENT OF MATHEMATICS
DECISION MODELS FOR MANAGEMENT
LINEAR PROGRAMMING FORMULATION AND GRAPHICAL METHOD
PART-A
1. What do you mean by a general LPP?
2. Define feasible region.
3. Define redundant constraint.
4. When we say that an LPP have (i) unique solution (ii) An infinite number of solutions
(iii) An unbounded solution

(iv) No solution

5. What do you understand by the term constraint? Explain with examples.

6. When can we use the graphical method for solving a LPP?
7. Solve the following linear programming problem graphically.
Max Z x y, subjetc to 2 x y 6, x 2 y 6, x, y 0.

8. State the limitations of the graphical method of solving a L.P.P.

9. Linear programming is the most widely used of problem solving,. Why?
10. What are the assumptions underlying linear programming?
11. What does the non-negativity restriction mean?
12. Name any two major requirements of LPP.
13. Distinguish between a resource and a constraint
14. What are the applications of linear programming?
15. Solve the following LPP graphically:
Max Z x y
subject to 2 x y 8, 2 x 3 y 12 and x, y 0

16. What are decision variables in the construction of operation research problems?
17. List the limitations of LPP.
18. What are the characteristics of linear programming?
19. State any three salient features of a L.P.P.
20. What are the decision variables in the construction of operations research problem?
*********************

KUMARAGURU COLLEGE OF TECHNOLOGY, COIMBATORE 06

DEPARTMENT OF MATHEMATICS
DECISION MODELS FOR MANAGEMENT
LINEAR PROGRAMMING FORMULATION AND GRAPHICAL METHOD
PART-B
1. Production allocation problem
A firm produces three products. These products are processed on three different
machines. The time required to manufacture one unit of each of the three products and
the daily capacity of the three machines are given in the table below:
Machine

Time Per unit(minutes)

Product 1
2
4
2

M1
M2
M3

Product 2
3
5

Product 3
2
3
-

Machine
capacity(minutes/day)
440
470
430

It is required to determine the number of units to be manufactured for each product daily.
The profit per unit for product 1, 2 and 3 is Rs.4, Rs.3 and Rs.6 respectively. It is
produced are consumed in the market, formulate the mathematical model for the problem.
2. Blending problem
A firm produces an alloy having the following specifications:
(i) Specific gravity 0.98
(ii) Chromium 8%
(iii) Melting point 450c
Raw materials A, B and C having the properties shown in the table can be used to make
the alloy.
Property
Specific gravity

RAW MATERIALS
A
B
C
0.92
0.97
1.04

Chromium

7%

Melting point

13%

440C 490C

16%
480C

Cost of the various raw materials per unit tons are: Rs.90 for A, Rs.280 for B and Rs.40
for C. Find the proportions which A, B and C be used to obtain an alloy of desired
Properties while the coast of raw materials is minimum.

3. Diet problem

A person wants to decide the constituents of a diet which will fulfill his daily
requirements of proteins, fats and carbohydrates at the minimum cost. The choice is to
be made from four different types of foods. The yields per unit of these foods are given
in the following table.
Food type
1
2
3
4
Minimum
requirement

Proteins
3
4
8
6
800

Yield/unit
Cost/unit
Fats
Carbohydrates
2
6
45
2
4
40
7
7
85
5
4
65
200
700

4. A farmer has 100 acre farm. He can sell all tomamtoes, lettuce, or radishes he can
raise. The price he can obtain is Rs. 1.00 per kg for tomatoes, RS 0.75 a head for
lettuce and Rs. 2.00 per kg for radishes. The average yield per-acre is 2,000 kgs of
tomatoes, 3000 heads of Lettuce, And 1000 Kgs of radishes. Fertilizer is available at
Rs.0.50 per kg and the amount required per acre is 100 kgs each for tomatoes and
lettuce and 50 kg of radishes.Labour required sowing, cultivating and harvesting per
acre is 5 man-days for tomatoes and radishes, and 6 man-days for lettuce. A total of
400 man-days of labour are available at Rs 20.00 per man-day.
Formulae this problem as LP model to maximize the farmers total profit.
5. Solve the following L.P.P by the graphical method

max Z 3 x1 2 x 2
2 x1 x 2 1
x1 2

Subject to

x1 x 2 3
and x1 , x 2 0

(b) Solve the following L.P.P by the graphical method.

min imize Z 3 x1 5 x2
3x1 4 x2 12
x1 4
2 x1 x2 2
x2 2
2 x1 3 x2 12 and x1 , x2 0

6. 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
3

Canned pineapple
2.0

Available resources
12.0

Labour
(man/hours)
Equipment
1
2.3
6.9
(Mc/hours)
Material
1
1.4
4.9
(unit)
Assuming one unit of canned juice and canned pineapple has profit margins Rs.2 and
Rs.1 respectively. Formulate this as a L.P.P. and solve it graphically also.
7. A company manufacturers 2 types of printed circuits. The requirements of transistors,
resistors and capacitors for each type of printed circuits along with other data are
given below:
Circuit

Stock available

A
B
Transistor
15
10
180
Resistor
10
20
200
Capacitor
15
20
210
Profit
Rs.5
Rs.8
How many circuits of each type should the company produce form the stock to earn
maximum profit.
8. Apply graphical method to solve the L.P.P: maximize

Z x1 2 x 2 subject to x1 x 2 1, 6 x1 4 x 2 24, 0 x1 5 and

2 x2 4

9. A company manufacturers two type of cloth, using three different colors of wool. One
yard length of type A cloth require 4 OZ of red wool, 5 OZ 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 manufacture is 1000 OZ of red
wool, 1000 OZ of green wool and 1200 OZ of yellow wool. The manufacturer can take
a profit of Rs.5 on one yard type A cloth and Rs. 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.
10. A company making cold drinks has two bottling plants at town T1 and T2 each
plant
produces three drinks A,B and C and their production capacity per day is given
below:
Cold drinks
A
B
C

Plant At
T1

T2

6000
1000
3000

2000
2500
3000

The marketing department of the company forecast 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 T1 and T2 are Rs. 6000 and Rs. 4000 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.
11. A firm manufactures two products A and B on which the profits earned per unit Rs.3
and Rs.4 respectively. Each product is processed on two machines M 1 and M 2
product A requires one minute of processing time on M 1 and two minutes on M 2
while B requires one minute on M 1 and one minute on M 2 . Machine M 1 is
available
for not more than 7 hours 30 minutes while machine M 2 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. Formulate the above as a L.P.P and solve by
graphical method.
12. Solve the following L.P.P graphically
max imize Z 100 x1 40 x 2
5 x1 2 x 2 1000
3 x1 2 x 2 900
x1 2 x 2 500
and x1 , x 2 0

13. Using graphical method

Maximize Z 2 x1 3 x 2
x1 x 2 2
x1 x 2 4 and x1 , x 2 0

14. Solve graphically the following L.P.P

Maxinmize Z 4 x1 3 x 2
x1 x 2 1
x1 x 2 0
and x1 , x 2 0

PART-A
Simplex methods-Linear programming
1. Define feasible solution.

2. Define optimal solution.

3. Define infeasible solution.
4. Define slack variables.
5. Define surplus variables.
6. Define unrestricted variables.
7. What do you mean by canonical form of a LPP?
8. What do you mean by standard form of a LPP?
9. Write the standard form of LPP in matrix form.
10. Is it meaning full to have a LPP for which the requirement vector b=0?
11. State the characteristics of the characteristics of the canonical form.
12. State the characteristics of the standard form.
13. State the characteristics of canonical form.
14. Express the following LPP in standard form:
Min Z 2 x1 x 2

subjetc to x1 x 2 1
2 x1 3 x 2 4
x1 , x 2 0

15. Express the following LPP in standard form:

Minimize Z x1 3 x 2

subjetc to 2 x1 3 x 2 2
x1 x 2 2
3 x1 x 2 3
x1 , x 2 0.

16. Express the following LPP in standard form:

Minimize Z 2 x1 3 x 2
subject to x1 x 2 5
3 x1 x 2 3
x1 0,

x 2 is unrestrict ed .

17. Define basic solution to an LPP.

18. What do you mean by basic variable and non-basic variables?

19. Find all the basic solutions of the following LPP.

Maxmize Z x1 x 2 2 x3
subject to x1 2 x3 x3 4
2 x1 x 2 5 x3 5
x1 , x 2 , x3 0

20. Write the general mathematical model of LPP in matrix form.

21. What is meant by optimally test?
22. Define

(i) Feasible solution

(ii) Basic solution and
(iii) Basic feasible solution of a LPP.

23. Define

(i) non-degenerate basic solution.

(ii) Degenerate basic solution.

24. What is meant by degeneracy of a LPP?

25. Explain the term feasible solution with an example.
26. What do you mean by an optimal solution of a LPP?
27. State the central problem of linear programming
28. What are slack and surplus variables?
29. What is the physical interpretation of a slack variable?
30. What is the difference between slack variables and surplus variable?
31. Which of the following solutions are feasible, in feasible, degenerate and
non- degenerate
(i ) x1 2 , x2 5 (ii ). x1 2 , x2 5 (iii ) x1 0 , x2 3 (iv) x1 5 , x2 3
32. Define a basic solution to a given system m simultaneous linear equations in n
unknown.
33. How many basic feasible solutions are there to a given system of 3 simultaneous
linear equations in 4 unknowns?
34. Find all the basic feasible solution of the simultaneous equations
2 x1 6 x 2 2 x3 x 4 3, 6 x1 4 x 2 4 x3 6 x 4 2

35. State the necessary and sufficient condition for a basic feasible solution of a LPP to
be an optimum solution.
36. What is key column? How is it selected?
37. What is key row? How is it selected?
38. What is the test of optimality in the simplex method? And how is the solution read
from simplex tableau?
39. What information can be derived from the optimum simplex tableau?
40. State the condition for an un bounded solution of a LPP?

41. When does the simplex arithmetic indicate that the LPP has unbounded solution?
42. What is infeasible solution? How is it identified in the simplex tableau?
43. How can you find whether the solution to a LPP is unique or not?
44. How is the presence of more than one optimal solution found out from the optimal
simplex table of a LPP?
45. How will you find whether a LPP has got an alternate optimal solution or not from
the optimal simplex table?
46. Why the artificial variables are called so?
47. What do you mean by BIG-M method?
48. When does an LPP posses a pseudo optimal solution?
49. Define artificial variables.
50. What are the uses of artificial variables.
51. Write the solution of the maximization LPP from the following optimum simplex
table. Also state the nature of the solution.
Cj

(-1

XB

x1
1
2
1
2

CB

YB

x2

s2

Cj

x2

s1
1
2

1
0

0)
s2
0

52. Write the nature of the solution of the maximization LPP from the following simplex
table.
Cj
(2
1
0
0)
CB

YB

XB

30

x1

20

x2
Z j C j

80

x1

x2

s1

s2

-1

-2

-4

53. What are slack variables in the solution of LPP?

54. While solving a LPP by simplex method, how will you find that the problem has got
an unbounded solution?
55. What is the difference between feasible solution and basic feasible solution?
56. What the disadvantages of Big-M method over two phase method?
PART-B

1. Using simplex method

Maximize Z 4 x1 10 x 2
subject to 2 x1 x 2 50
2 x1 5 x 2 100
2 x1 3 x 2 90 and x1 , x 2 0.

2. Find the non-negative values of x1 , x 2 and x3 which

Maximize Z 3 x1 2 x 2 5 x3
subjetc to x1 4 x 2 420

3 x1 2 x3 460
x1 2 x 2 x3 430
x1 , x 2 , x3 0

3. Solve the following:

Maximize :15 x1 6 x 2 9 x3 2 x 4
subject to 2 x1 x 2 5 x3 6 x 4 20
3 x1 x 2 3 x3 25 x 4 24
7 x1 x 4 70
x1 , x 2 , x3, x 4 0

4. Solve the following L.P.P. by simplex method

Minimize Z 8 x1 2 x 2

4 x1 2 x 2 1
5 x1 4 x 2 3
and x1 , x 2 0

5. Using simplex method to

Min z x 2 3 x3 2 x5
subject to 3 x 2 x3 2 x5 7
2 x 2 4 x3 12
4 x 2 3 x3 8 x5 10
and x 2 , x3 , x5 0

6. Solve the following LPP using simplex method

max imize Z x1 x 2 3x3

subject to 3 x1 2 x 2 x3 3
2 x1 x 2 2 x3 2
x1 , x 2 , x3 0

7. Solve simplex method:

max imize Z 3 x1 5 x 2 4 x3
subject to 2 x1 3 x 2 8
2 x 2 5 x3 10
3 x1 2 x 2 4 x3 15
x1 , x 2 , x3 0.

8. Solve by simplex method:

Maximize Z 2 x1 4 x 2 5 x3 6 x 4
subject to the constra int s
x1 4 x 2 2 x3 8 x 4 2
x1 2 x 2 3x3 4 x 4 1
x1 , x 2 , x3 , x 4 0.

9. Solve by simplex method:

Maximize 3x1 4 x 2 x3 7 x 4
subject to
8 x1 3x 2 4 x3 x 4 7
2 x1 6 x 2 x3 6 x 4 3
x1 4 x 2 5 x3 2 x 4 8
x1 , x 2 , x3 , x 4

BIG - M METHOD
10. Solve the following LPP
Min Z 12 x1 20 x 2
subject to 6 x1 8 x 2 100
7 x1 12 x 2 120
x1 , x 2 0.

11. Solve the following LPP minimize Z 4 x1 2 x 2

3 x1 x 2 27

Subject to

x1 x 2 21
x1 2 x 2 30
x1 , x 2 0.

12. Solve the following LPP: minimize Z 2 x1 3 x 2

x1 x 2 5

Subject to x1 2 x 2 6
x1 , x 2 0.

13. min imzie Z x1 2 x2 3 x3 x4

subject to x1 2 x2 3x3 15
2 x1 x2 5 x3 20
x1 2 x2 x3 x4 10
x1 , x2 , x3 0.
14. Minimize Z 4 x1 3x2
subject to 2 x1 x2 10
3 x1 2 x2 6
x1 x2 6
and x1 , x2 0
15. Minimize Z 2 x1 x2 x3
subject to 4 x1 6 x2 3x3 8
3 x1 6 x2 4 x3 1
2 x1 3 x2 5 x3 4
and x1 , x2 , x3 0

**************************