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 pa

Lpp, Determine feasible space for x1-x2= 8

Determine feasible space for x1-x2= 8

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ...

marginal rate of substitution, degeneracy and degenerate solution

''qualitative generic research'', Use the following article on qualitative ...

Use the following article on qualitative approaches written by Kahlke (2014), http://ejournals.library.ualberta.ca/index.php/IJQM/article/viewFile/19590/16141/ to answer the fol

Discuss the basic components of any queueing system, Question: (a) Disc...

Question: (a) Discuss briefly the four basic components of any queueing system. (b) Explain what you understand by the following models: (i) (M| M | 1 : N | FCFS) (ii

LINEAR PROGRAMMING, SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=...

SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0

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

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

Markov analysis, The town of Silverton, Colorado, has three gasoline statio...

The town of Silverton, Colorado, has three gasoline stations, Shell, Exxon, and Arco. Customer selection of service stations can be modeled as a Markov process, with the following

Linear programming , the application areas of linear programming

the application areas of linear programming

Production systems, How can you integrate environmental concerns into produ...

How can you integrate environmental concerns into production systems?

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