QUESTION BANK WITH ANSWERS

II PU MATHEMATICS
CHAPTER -12 Linear programming

[ 1 + 6 = 7 MARKS ]

One mark questions:

1. Define linear programming problem.
ANS: A linear programming problem deals with the optimisation
(maximisation/ minimisation) of a linear function of two variables (say x and
y) known as objective function subject to the conditions that the variables
are non-negative and satisfy a set of linear inequalities (called linear
constraints). A linear programming problem is a special type of optimisation
problem.

2. Define an optimization problem.

ANS: A problem which seeks to maximise or minimise a function is called
an optimisation problem.

3. Define decision variables.

ANS: In the objective function Z = ax + by, x and y are called decision
variables.

4. Define an objective function of a LPP.

ANS: Linear function Z = ax + by, where a and b are constants, which has
to be maximised or minimised is called a linear objective function.

5. Define a constraints of a LPP.

ANS: The linear inequalities or restrictions on the variables of an LPP are
called constraints. The conditions x ≥ 0, y ≥ 0 are called non-negative
constraints.

6. Define a feasible region of a LPP.

ANS: The common region determined by all the constraints including non-
negative constraints x ≥ 0, y ≥ 0 of an LPP is called the feasible region for the
problem.

7. Define a feasible solution of a LPP.

ANS: Points within and on the boundary of the feasible region for an LPP
represent feasible solutions.

Linear Programming
Page 1
8. Define an infeasible solution of a LPP.
ANS: Any Point outside feasible region is called an infeasible solution.

9. In a LPP, if the feasible region is bounded, with corner points. Where does
the optimum value of LPP exists.
ANS: On the corner points of the feasible solution.

10. Define optimal (feasible) solution of a LPP.

ANS: Any point in the feasible region that gives the optimal value (maximum
or minimum) of the objective function is called an optimal solution.

11. If the corner points of the feasible region determined by the linear
constraints of LPP are (0, 5), (4, 3), (0, 6) then find the minimum value of the
objective function Z = 200x + 500y.
ANS: (4, 3)
Z = 200(0) + 500(5) = 2500
Z = 200(4) + 500(3) = 2300 ⟹ Minimum
Z = 200(0) + 500(6) = 3000

12. If the corner points of the feasible region determined by the linear
constraints of a LPP are (0, 0) (30, 0) (20, 30) and (0, 50) find the maximum
value of the objective function Z = 4x + y.
ANS: (30, 0)
Z = 4(0) + 0 = 0
Z = 4(30) + 0 = 120 ⟹ Maximum
Z = 4(20) + 30 = 110
Z = 4(0) + 50 = 50

Linear Programming
Page 2
 Six marks questions:
1. Maximise Z = 3x + 4y subject to the constraints : x + y ≤ 4, x ≥ 0, y ≥ 0.

ANS: To Maximise Z =3x + 4y... (1)

subject to the constraints: x + y ≤ 4... (2)
x ≥ 0, y ≥ 0 ... (3)

x 0 4
Consider x + y = 4,
y 4 0
x ≥ 0, y ≥ 0 are called non negative constraints which represents the first
quadrant.
Origin test: For the origin (0, 0), x + y ≤ 4 ⟹ 0 + 0 ≤ 4 ⟹ 0 ≤ 4 which is
true. Hence the solution region lies towards the origin.
Now plottingting the graph as follows

Maximum value = 16 at (0, 4).

Linear Programming
Page 3
2. Minimise Z = – 3x + 4y subject to x + 2y ≤ 8, 3x + 2y ≤ 12, x ≥ 0, y ≥ 0. ANS:
To Minimise Z = - 3x + 4y... (1)
subject to the constraints: x + 2y ≤ 8... (2)
3x + 2y ≤ 12 …(3)
x ≥ 0, y ≥ 0 ... (4)

Consider, x + 2y = 8 x 0 8
y 4 0

x 0 4
Consider, 3x + 2y = 12
y 6 0
x ≥ 0, y ≥ 0 are called non negative constraints which represents the first
quadrant.
Origin test: For the origin (0, 0),
x + 2y ≤ 8 ⟹ 0 + 2(0) ≤ 8 ⟹ 0 ≤ 8 which is true.
3x + 2y ≤ 12 ⟹ 3(0) + 2(0) ≤ 12 ⟹ 0 ≤ 12 which is true.
Hence the solution region lies towards the origin.
Now plottingting the graph as follows

Maximum value = -12 at (4, 0).

Linear Programming
Page 4
3. Maximise Z = 5x + 3y subject to 3x + 5y ≤ 15, 5x + 2y ≤ 10, x ≥ 0, y ≥0. ANS:
To Maximise Z =5x + 3y... (1)
subject to the constraints: 3x + 5y ≤ 15... (2)
5x + 2y ≤ 10…(3)
x ≥ 0, y ≥ 0 ... (4)

Consider, 3x + 5y = 15 x 0 5
y 3 0

x 0 2
Consider, 5x + 2y = 10 y 5 0

x ≥ 0, y ≥ 0 are called non negative constraints which represents the first

quadrant.
Origin test: For the origin (0, 0),
3x + 5y ≤ 15 ⟹ 3(0) + 5(0) ≤ 15 ⟹ 0 ≤ 15 which is true.
5x + 2y ≤ 10⟹ 5(0) + 2(0) ≤ 10 ⟹ 0 ≤ 10which is true.
Hence the solution region lies towards the origin.
Now plotting the graph as follows

Maximum value = 12.36 at (1.05, 2.37).

Linear Programming
Page 5
4. Minimise Z = 3x + 5y such that x + 3y ≥ 3, x + y ≥ 2, x, y ≥ 0.
ANS: To Minimise Z = 3x + 5y... (1)
subject to the constraints: x + 3y ≥ 3... (2)
x + y ≥ 2…(3)
x ≥ 0, y ≥ 0 ... (4)

x 0 3
Consider, x + 3y = 3
y 1 0

x 0 2
Consider, x + y = 2 y 2 0

x ≥ 0, y ≥ 0 are called non negative constraints which represents the first

quadrant.
Origin test: For the origin (0, 0),
x + 3y ≥ 3 ⟹ 0 + 3(0) ≥ 3 ⟹ 0 ≥ 3which is false.
x + y ≥ 2 ⟹ 0 + 0 ≥ 2 ⟹ x + 0 ≥ 2 which is false.
Hence the solution region lies away from the origin.
Now plotting the graph as follows

Minimum value = 7 at (1.5, 0.5).

Linear Programming
Page 6
5. Maximise Z = 3x + 2y subject to x + 2y ≤ 10, 3x + y ≤ 15, x, y ≥ 0.
ANS: To Maximise Z =3x + 2y... (1)
subject to the constraints: x + 2y ≤ 10... (2)
3x + y ≤ 15…(3)
x ≥ 0, y ≥ 0 ... (4)

x 0 10
Consider, x + 2y = 10
y 5 0

x 0 5
Consider, 3x + y = 15
y 15 0

x ≥ 0, y ≥ 0 are called non negative constraints which represents the first

quadrant.
Origin test: For the origin (0, 0),
x + 2y ≤ 10⟹ 0 + 2(0) ≤ 10 ⟹ 0 ≤ 10 which is true.
3x + y ≤ 15⟹ 3(0) + 0 ≤ 15 ⟹ 0 ≤ 15 which is true.
Hence the solution region lies towards the origin.
Now plotting the graph as follows

Maximum value = 18 at (4, 3).

Linear Programming
Page 7
6. Minimise Z = x + 2y subject to 2x + y ≥ 3, x + 2y ≥ 6, x, y ≥ 0. Show that the
minimum of Z occurs at more than two points.
ANS: To Minimise Z = x + 2y... (1)
subject to the constraints: 2x + y ≥ 3... (2)
x + 2y ≥ 6…(3)
x ≥ 0, y ≥ 0 ... (4)

Consider, 2x + y = 3 x 0 1.5
y 3 0

x 0 6
Consider, x + 2y = 6 y 3 0
x ≥ 0, y ≥ 0 are called non negative constraints which represents the first
quadrant.

Origin test: For the origin (0, 0),

2x + y ≥ 3 ⟹ 2(0) + 0 ≥ 3 ⟹ 0 ≥ 3which is false.
x + 2y ≥ 6 ⟹ 0 + 2(0) ≥ 6 ⟹ 0 ≥ 6 which is false.
Hence the solution region lies away from the origin.
Now plotting the graph as follows

Minimum value = 6. It occurs at two points (6, 0) and (0, 3). Hence all the
points on the line joining the points (6, 0) and (0, 3) are also solutions.

Linear Programming
Page 8
7. Minimise and Maximise Z = 5x + 10y subject to x + 2y ≤ 120, x + y ≥ 60,
x – 2y ≥ 0, x, y ≥ 0.
ANS: To Maximise and minimise Z =5x + 10y... (1)
subject to the constraints: x + 2y ≤ 120... (2)
x + y ≥ 60…(3)
x – 2y ≥ 0 ….(4)
x ≥ 0, y ≥ 0 ... (5)
x 0 120
Consider, x + 2y = 120 y 60 0

Consider, x + y = 60 x 0 60
y 60 0
Consider, x – 2y = 0
x 0 40
y 0 20

x ≥ 0, y ≥ 0 are called non negative constraints which represents the first

quadrant.
Origin test: For the origin (0, 0),
x + 2y ≤ 120 ⟹ 0 + 2(0) ≤ 120 ⟹ 0 ≤ 120 which is true.
x + y ≥ 60 ⟹ 0 + 0 ≥ 60 ⟹ 0 ≥ 60which is false.
As x – 2y =0 passes through the origin, consider any point on either of the
axes, say (20, 0) on x–axis then x – 2y ≥ 0 ⟹ 20 − 2(0) ≥ 0 ⟹ 20 ≥ 0 which
is true. Hence the solution region is as shown in the graph.

Maximum value = 600 at all points on the line segment joining the points
(120, 0) and (60, 30).
Minimum value = 300 at (60, 0).

Linear Programming
Page 9
8. Minimise and Maximise Z = x + 2y subject to x + 2y ≥ 100, 2x – y ≤ 0, 2x + y
≤ 200; x, y ≥ 0.
ANS: To Maximise and minimise Z =x + 2y... (1)
subject to the constraints: x + 2y ≥ 100... (2)
2x – y ≤ 0…(3)
2x + y ≤ 200….(4)
x ≥ 0, y ≥ 0 ... (5)
x 0 100
y 50 0
Consider, x + 2y = 100
x 0 20
Consider, 2x – y = 0 y 0 40

Consider, 2x + y = 200 x 0 100

y 200 0

x ≥ 0, y ≥ 0 are called non negative constraints which represents the first

quadrant.
Origin test: For the origin (0, 0),
x + 2y ≥ 100⟹ 0 + 2(0) ≥ 100 ⟹ 0 ≥ 100 which is false
2x + y ≤ 200⟹ 2(0) + 0 ≤ 200 ⟹ 0 ≤ 200which is true.
As 2x – y = 0 passes through the origin, consider any point on either of the
axes, say (20, 0) on x–axis then 2x – y ≤ 0⟹ 2(20) – 0 ≤ 0 ⟹ 20 ≤ 0 which is
false. Hence the solution region is as shown in the graph.

Maximum value = 400 at (0, 200).

Minimum value = 100 at all points on the line segment joining the points
(0, 50) and (20, 40).
Linear Programming
Page 10
9. Maximise Z = – x + 2y, subject to the constraints: x ≥ 3, x + y ≥ 5, x + 2y ≥ 6,
x, y ≥ 0.
ANS: To Maximise Z = - x + 2y... (1)
subject to the constraints: x ≥ 3... (2)
x + y ≥ 5…(3)
x + 2y ≥ 6….(4)
x, y ≥ 0 ... (5)
Consider, x + y = 5 x 0 5
y 5 0

x 0 6
Consider, x + 2y = 6
y 3 0
x ≥ 0, y ≥ 0 are called non negative constraints which represents the first
quadrant.
𝑥 ≥ 3 ⟹means the solution region lies towards the right side of the line x =3.
Origin test: For the origin (0, 0),
x + y ≥ 5 ⟹ 0 + 0 ≥ 5 ⟹ 0 ≥ 5 which is false.
x + 2y ≥ 6 ⟹ 0 + 2(0) ≥ 6 ⟹ 0 ≥ 6which is false.
Hence the solution region away from the origin.
Now plotting the graph as follows

Maximum value does not exists.

Linear Programming
Page 11
10. Maximise Z = x + y, subject to x – y ≤ –1, –x + y ≤ 0, x, y ≥ 0.
ANS: To Maximise Z = x + y... (1)
subject to the constraints: x – y ≤ –1... (2)
–x + y ≤ 0…(3)
x ≥ 0, y ≥ 0 ... (4)

x 0 -1
Consider, x – y = –1
y 1 0

x 0 5
Consider, –x + y = 0
y 0 5
x ≥ 0, y ≥ 0 are called non negative constraints which represents the first
quadrant.
Origin test: For the origin (0, 0),
x – y ≤ –1⟹ 0 – 0 ≤ – 1 ⟹ 0 ≤ –1 which is false.
Hence the solution region lies away from the origin.
For some point say (0, 2), –x + y ≤ 0 ⟹ – 0 + 2 ≤ 0 ⟹ 2 ≤ 0which is false.
Hence the solution region lies to the opposite side of the point (0, 2).
Now plotting the graph as follows

Maximum value does not exists.

Linear Programming
Page 12
11. Reshma wishes to mix two types of food P and Q in such a way that the
vitamin contents of the mixture contain at least 8 units of vitamin A and 11
units of vitamin B. Food P costs Rs 60/kg and Food Q costs Rs 80/kg. Food
P contains 3 units/kg of Vitamin A and 5 units / kg of Vitamin B while food
Q contains 4 units / kg of Vitamin A and 2 units / kg of vitamin B.
Determine the minimum cost of the mixture.

ANS: Let the mixture contain x kg of food P and y kg of food Q.

* FOOD P (x) FOOD Q (y) REQUIREMENT (units/kg)

Vitamin A(units/kg) 3 4 8
Vitamin B(units/kg) 5 2 11
Cost (Rs/kg) 60 80 -

The objective function is Z = 60x + 80y.

To Minimise Z = 60x + 80y … (1) subject to the constraints,
3x + 4y ≥ 8 …(2)
5x + 2y ≥ 11 …(3)
x, y ≥ 0 … (4)
x ≥ 0, y ≥ 0 are called non negative constraints which represents the first
quadrant.
For the origin (0,0), 3x + 4y ≥ 80 ⇒ 3(0) + 4(0) ≥ 8 ⇒ 0≥ 8 which is false.
For the origin (0,0), 5x + 2y ≥ 11 ⇒ 5(0)+ 2(0) ≥ 11 ⇒ 0 ≥ 11 which is false.
Hence the solution region lies away the origin.

Hence, the minimum cost of the mixture will be Rs 160.

Linear Programming
Page 13
12. A cooperative society of farmers has 50 hectare of land to grow two crops X
and Y. The profit from crops X and Y per hectare are estimated as Rs 10,500
and Rs 9,000 respectively. To control weeds, a liquid herbicide has to be
used for crops X and Y at rates of 20 litres and 10 litres per hectare.
Further, no more than 800 litres of herbicide should be used in order to
protect fish and wild life using a pond which collects drainage from this
land. How much land should be allocated to each crop so as to maximise the
total profit of the society?

ANS: Let x hectare be the land allocated to crop X and y hectare be the land
allocated to crop Y.
To maximize the profit Z=10,500x+9000y…..(1) subject to the constraints
x + y ≤ 50 ……(2) ,
20x +10y ≤ 800 ⟹ 2x + y ≤ 80 ……(3),
x ≥ 0, y ≥ 0 …..(4)
x ≥ 0, y ≥ 0 are called non negative constraints which represents the first
quadrant.

The profit Z is maximum at B(30, 20) i.e., x = 30, y = 20.

i.e., 30 hectares of land is used for X crop and 20 hectare of land is used for
Y crop.
Linear Programming
Page 14
13. One kind of cake requires 200g of flour and 25g of fat, and another kind of
cake requires 100g of flour and 50g of fat. Find the maximum number of
cakes which can be made from 5kg of flour and 1 kg of fat assuming that
there is no shortage of the other ingredients used in making the cakes.
ANS: Let x be number of cakes of one kind and y be the number of cakes of
other kind.
To maximize Z = x + y------(1) subject to the constraints
200x + 100y ≤ 5000 ⟹ 2x + y ≤ 50 ------(2)
25x+50y ≤ 1000 ⟹ x + 2y ≤ 40-----(3)
x, y ≥ 0------(4)
x ≥ 0, y ≥ 0 are called non negative constraints which represents the first
quadrant.
Origin test: For the origin (0, 0),
2x + y ≤ 50⟹ 2(0) + 0 ≤ 50 ⟹ 0 ≤ 50 which is true.
x + 2y ≤ 40 ⟹ 0 + 2(0) ≤ 40 ⟹ 0 ≤ 40 which is true.
Hence the solution region lies towards the origin.
Now plotting the graph as follows

Z is maximum at B(20,10)
i.e., The maximum number of cakes can be made is 30 at B(20,10).

Linear Programming
Page 15
14. A furniture dealer deals in only two items- tables and chairs. He has
Rs.50,000 to invest and has storage space of at most 60 pieces. A table costs
Rs.2500 and a chair Rs.500. He estimates that from the sale of one table,
he can make a profit of Rs. 250 and that from the sale of one chair a profit
of Rs.75. How many tables and chairs he should buy from the available
money so as to maximize his total profit assuming that he can sell all the
items which he buys.
ANS: Let x be the number of tables and y be the number of chairs.
To maximize the profit Z = 250x + 75y -----(1) subject to the constraints
2500x + 500y ≤ 50000 ⟹ 5x + y ≤ 100 ---(2)
x + y ≤ 60 -----(3)
x, y ≥ 0-----(4)

x ≥ 0, y ≥ 0 are called non negative constraints which represents the first

quadrant.
Origin test: For the origin (0, 0),
5x + y ≤ 100⟹ 5(0) + 0 ≤ 100 ⟹ 0 ≤ 100 which is true.
x + y ≤ 60 ⟹ 0 + 0 ≤ 60 ⟹ 0 ≤ 60 which is true.
Hence the solution region lies towards the origin.
Now plotting the graph as follows

The profit Z is maximum at B(10,50)

Maximum profit=Rs.6250
Linear Programming
Page 16
15. A factory makes tennis rackets and cricket bats. A tennis racket takes 1.5
hours of machine time and 3 hours of craftsman’s time in its making while a
cricket bat takes 3 hour of machine time and 1 hour of craftsman’s time. In
a day, the factory has the availability of not more than 42 hours of machine
time and 24 hours of craftsman’s time.
(i) What number of rackets and bats must be made if the factory is to
work at full capacity?
(ii) If the profit on a racket and on a bat is Rs 20 and Rs 10 respectively,
find the maximum profit of the factory when it works at full capacity.
ANS: Let the number of rackets and the number of bats to be made be x
and y respectively.

* Tennis Racket(x) Cricket Availability

Bat(y)

Machine Time in hrs 1.5 3 42

Craftsman’s Time in hrs 3 1 24

(i) The factory is to work at full capacity.

3
Therefore, 1.5x + 3y = 42 ⟹ x + 3y =42 ⟹ 3x + 6y = 84…..(1)
2
3x + y = 24……(2)
(1) – (2) gives 5y = 60 ⟹ y = 12,
From (2), 3x + y = 24 ⟹ 3x + 12 = 24 ⟹ x = 4
Thus, 4 rackets and 12 bats must be made.

(ii) The profit on a racket is Rs 20 and on a bat is Rs 10. The objective

function is Z = 20x + 10y.

To Maximize Z = 20x +10y … (1) subject to the constraints,

3
1.5 x + 3y ≤ 42 …⟹ x + 3y ≤ 42 ⟹ 3x + 6y ≤ 84….. (2)
2
3x + y ≤ 24 …(3)
x, y ≥ 0 … (4)

x ≥ 0, y ≥ 0 are called non negative constraints which represents the first

quadrant.
Consider 3x + 6y = 84 x 0 28
y 14 0

Linear Programming
Page 17
Consider 3x + y = 24 x 0 8
y 24 0

Origin test: For the origin (0, 0),

3x + 6y ≤ 84 ⟹ 3(0) + 6(0) ≤ 84 ⟹ 0 ≤ 84 which is true.
3x + y ≤ 24 ⟹ 3(0) + 0 ≤ 24 ⟹ 0 ≤ 24 which is true.

Hence the solution region lies towards the origin.

Thus, the maximum profit of the factory when it works to its full capacity is
Rs 200.

Linear Programming
Page 18
16. A manufacturer produces nuts and bolts. It takes 1 hour of work on
machine A and 3 hours on machine B to produce a package of nuts. It takes
3 hours on machine A and 1 hour on machine B to produce a package of
bolts. He earns a profit of Rs 17.50 per package on nuts and Rs 7.00 per
package on bolts. How many packages of each should be produced each day
so as to maximize his profit, if he operates his machines for at the most 12
hours a day ?

ANS : Let x and y be the packages of nuts and bolts produced by machine A
and B respectively.

To maximize Z = 17.5x + 7y ----(1) subject to the constraints

x + 3y ≤ 12----(2)

3x + y ≤ 12--------(3)

x, y ≥ 0 ------(4)

x ≥ 0, y ≥ 0 are called non negative constraints which represents the first

quadrant.
Origin test: For the origin (0, 0),
x + 3y ≤ 12⟹ 0 + 3(0) ≤ 12 ⟹ 0 ≤ 12which is true.
3x + y ≤ 12⟹ 3(0) + 0 ≤ 12 ⟹ 0 ≤ 12which is true.
Hence the solution region lies towards the origin.

The profit Z is maximum at B(3,3)

Maximum profit=Rs.73.50
Linear Programming
Page 19
17. A factory manufactures two types of screws, A and B. Each type of screw
requires the use of two machines, an automatic and a hand operated. It
takes 4 minutes on the automatic and 6 minutes on hand operated
machines to manufacture of package of screws A, while it takes 6 minutes
on automatic and 3 minutes on the hand operated machines to
manufacture a package of screws B. Each machine is available for at the
most 4 hours on any day. The manufacturer can sell a package of screws A
at a profit of Rs 7 and screws B at a profit of Rs 10. Assuming that he can
sell all the screws he manufactures, how many packages of each type
should the factory owner produce in a day in order to maximize his profit?
Determine the maximum profit.

ANS: Let the factory manufacture x screws of type A and y screws of type B
on each day.
* SCREW A SCREW B AVAILABILITY (min)
Automatic Machine (min) 4 6 4(60) = 240
Hand operated Machine (min) 6 3 4(60) =240
Objective Function is profit, Z = 7x +10y.
Hence to Maximize Z = 7x + 10y … (1) subject to the constraints,
4x + 6y ≤ 240 ⟹ 2x + 3y ≤ 120… (2)
6x + 3y ≤240 ⟹ 2x +y ≤ 80…(3)
x, y ≥ 0 … (4)
The feasible region determined by the system of constraints is as follows.

Thus, the factory should produce 30 packages of screws A and 20 packages

of screws B to get the maximum profit of Rs 410.

Linear Programming
Page 20
18. A cottage industry manufactures pedestal lamps and wooden Shades, each
requiring the use of a grinding / cutting machine and a sprayer. It takes 2
hours on grinding / cutting machine and 3 hours on the sprayer to
manufacture a pedestal lamp. It takes 1 hour on the grinding / cutting
machine and 2 hours on the sprayer to manufacture a shade. On any day,
the sprayer is available for at the most 20 hours and the grinding / cutting
machine for at the most 12 hours. The profit from the sale of a lamp is Rs 5
and that from a shade is Rs 3. Assuming that the manufacturer can sell all
the lamps and shades that he produces, how should he schedule his daily
production in order to maximize his profit ?

ANS: Let the cottage industry manufacture x pedestal lamps and y wooden
shades.

* LAMPS (x) SHADES(y) AVAILABILITY (min)

Grinding/cutting Machine (hrs) 2 1 12
Sprayer (hrs) 3 2 20
Objective Function is profit, Z = 5x +3y.

Hence to Maximize Z = 5x + 3y … (1) subject to the constraints,

2x + y ≤ 12 … (2)
3x + 2y ≤20 …(3)
x, y ≥ 0 … (4)
The feasible region determined by the system of constraints is as follows.

The maximum value of Z is 32 at (4, 4).

Thus, the manufacturer should produce 4 pedestal lamps and 4 wooden
shades to maximize his profits.

Linear Programming
Page 21
19. A company manufactures two types of novelty souvenirs made of plywood.
Sourvenirs of type A require 5 minutes each for cutting and 10 minutes
each for assembling. Souvenirs of type B require 8 minutes each for cutting
and 8 minutes each for assembling. There are 3 hours 20 minutes available
for cutting and 4 hours for assembling. The profit is Rs 5 each for type A
and Rs 6 each for type B souvenirs. How many souvenirs of each type
should the company manufacture in order to maximize the profit?

ANS : Let the company manufacture x souvenirs of type A and y souvenirs

of type B.
* TYPE A (x) TYPE B (y) AVAILABILITY (min)
Cutting (min) 5 8 3 x 60 +20 = 200
Assembling (min) 10 8 4 x 60 = 240
Objective Function is profit, Z = 5x +6y.

Hence to Maximize Z = 5x + 6y … (1) subject to the constraints,

5x + 8y ≤ 200 … (2)
8x + 8y ≤240 …(3)
x, y ≥ 0 … (4)
The feasible region determined by the system of constraints is as follows.

The maximum value of Z is 160 at (8, 20).

Thus, 8 souvenirs of type A and 20 souvenirs of type B should be produced
each day to get the maximum profit of Rs 160.

Linear Programming
Page 22
20. A merchant plans to sell two types of personal computers – a desktop model
and a portable model that will cost Rs 25,000 and Rs 40,000 respectively.
He estimates that the total monthly demand of computers will not exceed
250 units. Determine the number of units of each type of computers which
the merchant should stock to get minimum profit if he does not want to
invest more than Rs 70 lakhs and if his profit on the desktop model is Rs
4,500 and on portable model is Rs 5000.

ANS : Let the merchant stock x desktop models and y portable models.

Objective Function is profit, Z = 4500x +5000y.

Hence to Maximize Z = 4500x + 5000y … (1) subject to the constraints,

25000x + 40000y ≤ 700000 ⟹ 5x +8y ≤ 1400… (2)
x + y ≤ 250 …(3)
x, y ≥ 0 … (4)
The feasible region determined by the system of constraints is as follows.

The maximum value of Z is 1150000 at (200, 50).

Thus, the merchant should stock 200 desktop models and 50 portable
models to get the maximum profit of Rs 1150000.

Linear Programming
Page 23