CHAPTER TWO

LINEAR INEQUALITIES AND LINEAR PROGRAMING

Exercise - 2(B), 2(C)

1. Solve the following linear programing problem by graphical or simplex method:

a. Maximize Z = 9x + 13y subject to 2x + 3y 18; 2x + y 10; x 0, y 0.
b. Maximize Z = 5x + 3y subject to 2x + y 40; x + 2y 50; x 0, y 0.
c. Maximize Z = 3x + 4y subject to 6x + 4y 60; x + 2y 22; x 0, y 0.
d. Maximize Z = 7x + 5y subject to the constraints x + 2y 6; 4x + 3y 12; x 0, y 0.
e. Minimize Z = 2x + y subject to 5x + 3y 9; x + y10; x 0, y 0.
f. Maximize P = 2x + 3y subject to x + 2y 10; 2x + y 14; x 0, y 0.
g. Minimize Z = 9x + 10y subject to the constraints x + 2y 25; 3x + 2y 60; x 0, y 0.
h. Maximize Z = 20x + 10y subject to 3x + y 12; 2x + 3y 24; x 0, y 0.
i. Minimize Z = 25x + 60y subject to the constraints x + 3y 9; 2x + 2y 10; x 0, y 0.
j. Minimize Z = x + y subject to the constraints 3x + 2y 12; x + 3y 9; x 0, y 0.
2. A factory turns out two articles A and B, each of which processed by two machines M and N. Article A
requires 2 hours of M and 4 hours of N. Similarly, article B requires 4 hours of M and 2 hours of N.
Noting that neither M nor N can work more than 24 hours a day. Assuming that all articles produced are
sold. If each article A yields a profit of Rs 60 and each article B yields a profit of Rs 100.
a. Formulate the above information in the linear programing model.
 b. Use simplex or graphical method. Find how many of each articles should be produced daily for
getting
maximum profit.
c. Calculate the maximum profit.
3. A watch dealer wishes to buy new watches and has two models M 1 and M2 to choose. Model M1 costs Rs
100 and M2 costs Rs 200. In view of the showcase of the dealer, he wants to buy watch not more than 30
and can spend up to Rs 4,000. The watch dealer can make a profit od Rs 30 in M1 and Rs 50 in M2.
a. Formulate the above information in the linear programming model
b. Using simplex or graphical method, find how many of each model should be buy to obtain maximum
profit and hence find the maximum profit.
4. A firm manufactures two products A and B on which profit earned per unit are Rs 30 and Rs 40
respectively. Each product is processed on two machines M and N. The product A requires 9 minutes on
and 5 minutes on N while B requires 8 minutes on M and 2 minutes on N. Machine is available for 520
minutes and Machine N is available for 340 minutes during any working day.
a. Formulate the problems as Linear Programming Problem to get the maximum profit.
b. Using simplex or graphical method, find how many of each model should he buy to obtain maximum
profit and hence find the maximum profit.
5. Production of a certain chemical mixture should contain 80 mg. chlorides and 28 mg. nitrate per kg. The
company can use two substances. Substance X contains 8 mgs. Chlorides and 4 mgs. Nitrates per gram.
Substance Y contains 10 mgs. Chlorides and 2 mgs. Nitrates per gram. Both substances cos Rs 20 per
gram. It is required to produce the mixture using X and Y so that cost is minimized.
 b. Using simplex or graphical method, find how many of each model should he buy to obtain minimum
profit and hence find the minimum profit.
6. Food P contains 5 units of vitamin A per gram and 8 units of vitamin B per gram and costs Rs 10 per
gram. Food Q contains 8 units of vitamin A and 10 units of vitamin B per gram and costs Rs 20 per
gram. The daily minimum requirement of vitamin A and vitamin B are 80 units and 120 units
respectively. Formulate the given problem in a liner programing model with the objective of minimizing
the cost. Also calculate the minimum cost by using graphical or simplex method.