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

Report writing - report writing presentation, REPORT WRITING The final...

REPORT WRITING The final step in research is to report the study  findings to those  who authorized the investigation. The American marketing association is  of the opinion  t

Calculate the yearly cost of waiting time, The Omega company, Brisbane, pro...

The Omega company, Brisbane, produces potato chips, corn, cheese twists, and popcorn. These products are made in Brisbane and then shipped to company warehouses and distribution ce

Steps of field study, Festinger and Katz have described followings six ste...

Festinger and Katz have described followings six steps in the conduct to a field study. a. Preliminary Planning :Deciding scope and objectives of study and the time table

Operation research and decision making, Operations Research uses the meth...

Operations Research uses the methods of science to understand and explain the phenomena of operating systems. It devises the theories( models ) to explain these phenomena

Semeter 5, explian completelly the operation reserch

explian completelly the operation reserch

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Performance analysis of video call using skype, Description      Skype i...

Description      Skype is currently the most popular VoIP software in the world. Existing research has indicated that Skype can provide better voice/video quality in adverse net

LLP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Linear programming, Ask question #Minimum 100 words acceptNas food produces...

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

Solved a.q, Solve the following Linear Programming Problem using Simple met...

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

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