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 , A paper mill produces two grades of paper viz., X 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

Explain the process of problem identification with an exampl, Question ...

Question 1 Explain the process of problem identification with an example 2 Interview method involves a dialogue among the Interviewee and the Interviewer. Describe the inter

Weaning and definition, Weaning  and Definition A systematic  arrange...

Weaning  and Definition A systematic  arrangement of classified  data in labelled columns and  rows  is  known  a statistical table. Turtle has given  a comprehensive defin

Action Phase, What is The proper meaning of action phase will u help me to ...

What is The proper meaning of action phase will u help me to lern it in deeply????

Linear Programming , A Paper mill produces two grades of paper viz. X 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 in

Linear pograming, application area of linear programing problem

application area of linear programing problem

Tables and graphs, Normal 0 false false false EN-IN ...

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

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 0

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