Development of lp problems, Operation Research

Assignment Help:

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

 

 


Related Discussions:- Development of lp problems

Linear programming problem, A paper mill produces two grades of paper viz.,...

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

Operations Decision, 2.Assess the current environmental scan factors that a...

2.Assess the current environmental scan factors that are relevant to the decision making process. Determine the factors that will have the greatest impact on plant operations and m

Linear proramming , A paper mill produces two grades of paper viz., X and Y...

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

Inventory control research, Given an inventory system where Yearly demand ...

Given an inventory system where Yearly demand = 120 units Ordering cost = Sh. 45 Price per unit = Sh. 200 Annual carrying cost = 24% of the unit cost Determine The economic or

Linear programming, Meaning of Linear programming problem and explanation o...

Meaning of Linear programming problem and explanation of graphical method of solving Linear Programming Problem

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

Dynamic programming models, Dynamic programming may be considered thoutgr...

Dynamic programming may be considered thoutgrowth of mathematical programming and involves the optimization of multistage( sequence of inter related decisions) decision process

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd