Development of lp problems, Operation Research

A company manufactures 2 kinds of hats. Each hat of the I type needs twice as much as labour time as the II type. The company can manufacture a sum of 500 hats a day. The market restricts daily sales of I and II types to 150 and 250 hats. Supposing that the gain per hat is Rs.8 for type A and Rs. 5 for type B. Develop LPP models so as to find out the number of hats to be manufactured of each type so as to maximize the gain (profit).

Answer

Assume x1 - number of hats produced by type A

Assume x2 - number of hats produced by type B

 

Maximize Z = 8x1 + 5x2

Subject to

2x1 + x2 ≤ 500 (labour time)

                        x1 ≤ 150

                        x2 ≤ 250

                 x1≥0, x2 ≥0

 

 

Posted Date: 7/4/2012 3:13:36 AM | Location : United States







Related Discussions:- Development of lp problems, Assignment Help, Ask Question on Development of lp problems, Get Answer, Expert's Help, Development of lp problems Discussions

Write discussion on Development of lp problems
Your posts are moderated
Related Questions
#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

A factory employs unskilled workers earning $135 per week and skilled workers earning $270 per week. It is required to keep the weekly age bill below $24,300. The machine requires

INFORMATION RESOURCES - SELECTION PRINCIPLES: Selection of materials for a library requires sagacity, adroitness and attention to people's needs for everything from books and

A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 tons of grade Y paper i

Q3. Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 4 X

Stratified Sample Size The  sampling  study  has depended  much on the stratified sample  to reduce  the sampling  error, samples  size may have a number of strata or  cluster

Solve the following Linear Programming Problem using simple method Maximize Z= 3x1 + 2x2 Subject to the constraints: X1 + X2 = 4

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Normal 0 false false false EN-IN X-NONE X-NONE