Scribd
Upload
2K views5 pages

Linear Programming Assignment Answers

The document describes 4 linear programming problems. The first problem involves maximizing profit from producing two products (M1 and M2) given constraints on grinder and polisher hours. The second problem involves maximizing profit from two products (A and B) given constraints on raw materials and labor hours. The third problem involves minimizing cost of fertilizer from two mixtures given constraints on phosphate and nitrogen requirements. The fourth problem involves maximizing income from three cloth types given constraints on available wool. For each problem, the document identifies decision variables, defines the objective function to maximize/minimize, and lists the constraints.

Uploaded by

jeganrajraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2K views5 pages

Linear Programming Assignment Answers

The document describes 4 linear programming problems. The first problem involves maximizing profit from producing two products (M1 and M2) given constraints on grinder and polisher hours. The second problem involves maximizing profit from two products (A and B) given constraints on raw materials and labor hours. The third problem involves minimizing cost of fertilizer from two mixtures given constraints on phosphate and nitrogen requirements. The fourth problem involves maximizing income from three cloth types given constraints on available wool. For each problem, the document identifies decision variables, defines the objective function to maximize/minimize, and lists the constraints.

Uploaded by

jeganrajraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Assignment I

Formulation of Linear Programming (to be submitted on 28/09/2015)

1. A manufacturer produces two types of models M1 and M2.Each model of the


type M1requires 4 hours of grinding and 2 hours of polishing; whereas each
model of M2 requires 2 hours of grinding and 5 hours of polishing. The
manufacturer has 2 grinders and 3 polishers. Each grinder works for 40
hours a week and each polisher works 60 hours a week. Profit on M1 model
is Rs.3.00 and on model M2 is Rs.4.00.Whatever produced in a week is sold
in the market. How should the manufacturer allocate his production
capacity to the two types of models, so that he makes maximum profit in a
week?
i) Identify and define the decision variable of the problem

Let X1 and X2 be the number of units of M1 and M2 model

ii) Define the objective function

Since the profits on both the models are given, the objective function is
to maximize the profit.
Max Z = 3X1 + 4X2

iii) State the constraints to which the objective function should be


optimized (i.e. Maximization or Minimization)

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)

Max Z = 3X1 + 4X2


Subject to constraints,
4X1 + 2X2 < 80
2X1 + 5X2 < 180
X1, X2 > 0
2. A firm is engaged in producing two products. A and B. Each unit of product
A requires 2 kg of raw material and 4 labour hours for processing, where as
each unit of B requires 3 kg of raw materials and 3 labour hours for the
same type. Every week, the firm has an availability of 60 kg of raw material
and 96 labour hours. One unit of product A sold yields Rs.40 and one unit
of product B sold gives Rs.35 as profit. Formulate this as an Linear
Programming Problem to determine as to how many units of each of the
products should be produced per week so that the firm can earn maximum
profit.
i) Identify and define the decision variable of the problem

Let X1 and X2 be the number of units of product A and product B


produced per week.

ii) Define the objective function.

Since the profits of both the products are given, the objective function is
to maximize the profit.
Max Z = 40X1 + 35X2

iii) State the constraints to which the objective function should be


optimized (i.e. Maximization or Minimization)

There are two constraints one is raw material constraint and the other
one is labour constraint.

The raw material constraint is given by


2X1 + 3X2 < 60
2

Assignment I
Formulation of Linear Programming (to be submitted on 28/09/2015)

The labour hours constraint is given by


4X1 + 3X2 < 96
Finally we have,
Max Z = 40X1 + 35X2
Subject to constraints,
2X1 + 3X2 < 60
4X1 + 3X2 < 96
X1,X2 > 0
3. The agricultural research institute suggested the farmer to spread out at
least 4800 kg of special phosphate fertilizer and not less than 7200 kg of a
special nitrogen fertilizer to raise the productivity of crops in his fields.
There are two sources for obtaining these mixtures A and mixtures B.
Both of these are available in bags weighing 100kg each and they cost Rs.40
and Rs.24 respectively. Mixture A contains phosphate and nitrogen
equivalent of 20kg and 80 kg respectively, while mixture B contains these
ingredients equivalent of 50 kg each. Write this as an LPP and determine
how many bags of each type the farmer should buy in order to obtain the
required fertilizer at minimum cost.
i) Identify and define the decision variable of the problem

Let X1 and X2 be the number of bags of mixture A and mixture B.

ii) Define the objective function

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)

20X1 + 50X2 >4800 Phosphate requirement


80X1 + 50X2 >7200 Nitrogen requirement
X1, X2 >0

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.

ii) Define the objective function

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

iii) State the constraints to which the objective function should be


optimized.

The above objective function is subjected to following three constraints.


2X1 + 3X2 < 8
2X2 + 5X3 < 10
3X1 + 2X2 + 4X3 < 15
X1, X2 X3 >0

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

You might also like