Linear Programming Assignment Answers
Linear Programming Assignment Answers
Since the profits on both the models are given, the objective function is
to maximize the profit.
Max Z = 3X1 + 4X2
There are two constraints one for grinding and the other for polishing.
The grinding constraint is given by
4X1 + 2X2 < 80
No of hours available on grinding machine per week is 40 hrs. There are two
grinders. Hence the total grinding hour available is 40 X 2 = 80 hours.
The polishing constraint is given by
2X1 + 5X2 < 180
No of hours available on polishing machine per week is 60 hrs. There are three
grinders. Hence the total grinding hour available is 60 X 3 = 180 hours.
Finally we have,
1
Assignment I
Formulation of Linear Programming (to be submitted on 28/09/2015)
Since the profits of both the products are given, the objective function is
to maximize the profit.
Max Z = 40X1 + 35X2
There are two constraints one is raw material constraint and the other
one is labour constraint.
Assignment I
Formulation of Linear Programming (to be submitted on 28/09/2015)
The cost of mixture A and mixture B are given; the objective function is
to minimize the cost
Min. Z = 40X1 + 24X2
iii) State the constraints to which the objective function should be optimized.
The above objective function is subjected to following constraints.
3
Assignment I
Formulation of Linear Programming (to be submitted on 28/09/2015)
Finally we have,
Min.Z = 40X1 + 24X2
is subjected to three constraints
20X1 + 50X2 >4800
80X1 + 50X2 >7200
X1, X2 >0
4. A firm can produce 3 types of cloth, A , B and C.3 kinds of wool are
required Red, Green and Blue.1 unit of length of type A cloth needs 2
meters of red wool and 3 meters of blue wool.1 unit of length of type B
cloth needs 3 meters of red wool, 2 meters of green wool and 2 meters of
blue wool.1 unit type of C cloth needs 5 meters of green wool and 4
meters of blue wool. The firm has a stock of 8 meters of red, 10 meters of
green and 15 meters of blue. It is assumed that the income obtained
from 1 unit of type A is Rs.3, from B is Rs.5 and from C is
Rs.4.Formulate this as an LPP.
i) Identify and define the decision variable of the problem
Let X1, X2 and X3 are the quantity produced of cloth type A,B and C
respectively.
Assignment I
Formulation of Linear Programming (to be submitted on 28/09/2015)
The incomes obtained for all the three types of cloths are given; the
objective function is to maximize the income.
Max Z = 3X1 + 5X2 + 4X3
Finally we have,
Max Z = 3X1 + 5X2 + 4X3
is subjected to three constraints
2X1 + 3X2 < 8
2X2 + 5X3 < 10
3X1 + 2X2 + 4X3 < 15
X1, X2 X3 >0