Académique Documents
Professionnel Documents
Culture Documents
- 2 hours of polishing.
- 5 hours of polishing.
The manufacturer has 2 grinders and 3 polishers. Each grinder works for
40 hours a week and each polisher works for 60 hours per week. Profit per
each item of product P1 = Rs 3/- and Rs 4/- on product P2. Whatever is
produced in a week is sold in the market. How should the manufacturer
allocate his production capacity to the 2 types of product so that he may have
maximum profit in a week.
Solution
X1 from product P1
4x 1 + 2x2 ≤ 80
Find 2 real no.s (x1 & x2) such that z = 3x1 + 4x 2 will be maximum subjected to
constraints : (i) 4x1 + 2x2 ≤ 80
x1, x2 ≥ 0
z/(A) = 3×20+4× 0 = 60
z/(B) = 3x1 + 4x 2 where x1 & x2 are obtained by
→ 4x 1 + 10x2 = 360
8x 2 = 280
→ x2 = 35
So, the no. of products from P1 = x1 = 2 nos (not (3) as it will be away from
Feasible zone)
From P2 = x2 = 35 nos.
To get maximum profit and the value of maximum profit = 3×2 + 4×35
= 146 ans.
When the no. of variables (x1, x2 ……..) is more than two, the LPP is called
general LPP. For such LPP the graphical method fails & the only method used
to solve is simplex algorithm.
Solution
Mathematical formulation
Let aij denote the number of units of nutrient I in one unit of foodstuff j where
I = 1,2,3,……………m
& j = 1,2,3,………….n
for j = 1,2,3,………………n
Final Considering of Cost, let cj be the cost per unit of food j. Then the total
cost of the diet in given by:
Z=CI X I + C2 X2 + --- + Cn Xn
Thus the above problem of selecting the best diet reduces to the
following mathematical form;
It is general in the sense that the data bi, aij and cj are parameters,
which for different sets of values will give rise to different problems. we can
now give the formal definition of General LLP.
(a) z= cI xI + c2 x2 + --- cn xn
where cjs are constants. Let aij be an mxn real matrix and let bI, b2 --- bm are
set of constants such that
z= cI xI + c2 x2 + --- cn xn
An n-type (xI x2 --- xn) of real numbers which satisfies the constraints of a
general LLP is called a solution to the general LPP.
Definition of feasible solution:
Any solution to a general LPP which also satisfies the non negative restriction
of the problem is called feasible solution to the general LPP.
∑ aij xj +xn+I = bi