Scribd
Upload
3 views1 page

Linear Programing Problem Formulation

The document presents two linear programming problems: the first involves a furniture manufacturer optimizing the production of tables and chairs given constraints on timber and man-hours to maximize profit, formulated as Max.z=12x+5y with specific resource constraints. The second problem focuses on a cattle breeding firm minimizing the cost of fodder while meeting nutrient requirements, formulated as Min.Z=3X+2Y with associated constraints for nutrients A, B, and C. Both problems include variables, objective functions, and constraints necessary for linear programming solutions.

Uploaded by

Pijush Mondal
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views1 page

Linear Programing Problem Formulation

The document presents two linear programming problems: the first involves a furniture manufacturer optimizing the production of tables and chairs given constraints on timber and man-hours to maximize profit, formulated as Max.z=12x+5y with specific resource constraints. The second problem focuses on a cattle breeding firm minimizing the cost of fodder while meeting nutrient requirements, formulated as Min.Z=3X+2Y with associated constraints for nutrients A, B, and C. Both problems include variables, objective functions, and constraints necessary for linear programming solutions.

Uploaded by

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

Linear programing problem formulation

1. A furniture manufacturer wishes to determine the number of tables and chairs to be made
by him in order to optimize the use of his available resources. These products utilize two
different types of timber and he has on hand 1500 board feet of the first type and 1000
board feet of the second type. He has 800 man-hours available for the total job .Each table
and chair requires 5 and 1 board feet respectively, of the first type of timber and 2 and 3
board feet respectively, of the second type. 3 man-hours are required to make a table and 2
man-hours are needed to make a chair. The manufacturer makes a profit of Rs. 12.00 on a
table and Rs.5.00 on a chair. Write out the complete linear programming formulation of the
problem in terms of maximizing the profit.
Solution-
Let x be the number of tables and y be the number of chairs.
Now available 1st type timber 1500, 2nd type timber 1000 and man-hours 800.
For each chair 5 1st type timber, 2 2nd type timber and 3 man-hour
For each table 1 1st type timber, 3 2nd type timber and 2 man-hour
For profit each chair Rs. 12 and each table Rs. 5.00
Max.z=12x+5y
s/t 5x+y ≤ 1500,
2x+3y ≤ 1000,
3x+2y ≤ 800,
x,y≥0
2. At a cattle breeding firm it is prescribed that the food ration for one animal must contain at
least 14,22 and 1 units of nutrients A,B and C respectively. Two different kinds of fodder are
available. Each unit weight of these two contains the following amounts of the three
nutrients:
Fodder 1 Fodder 2
Nutrient A 2 1
Nutrient B 2 3
Nutrient C 1 1
It is given that the costs of unit quantity of fodder 1 and fodder 2 are 3 and 2 monetary
units respectively. Pose a linear programing problem in terms of minimizing the cost of
purchasing the fodders for the above cattle breeding firm.
Solution –
Let X,Y are the unit weights of the fodder 1 and fodder 2,
Min. Z=3X+2Y,
S/t 2X+Y≥ 14,
2X+3Y ≥22,
X+Y ≥ 1,
X,Y ≥0

You might also like