LINEAR PROGRAMMING, Operation Research

Assignment Help:
A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run for a maximum of 12 hours per day and B for 8 hours per day and profits from X1 and X2 are Rs. 4 and Rs. 5 per unit respectively , find out how many units per day be produced to have a maximum profit .Use Graphical method.

Related Discussions:- LINEAR PROGRAMMING

Categorizing operations research problems, what are the categorization of o...

what are the categorization of operations research problems?

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

Ap problem, Ask question A Company produces 150 cars. But the production ra...

Ask question A Company produces 150 cars. But the production rate varies with the distribution. Production Rate Probability 147 0.05 148 0.10 149 0.15 150 0.20 151 0.30 152 0.15 15

Census method, Census Methods Complete Enumeration: If detail informat...

Census Methods Complete Enumeration: If detail information  regarding every individual  person  or item of a given   universe ( or  population ) is  collected then the  enquir

Determination of objectives and values, In the judgement phase due care ...

In the judgement phase due care must be given to define correctly the frame of references of the operation. Objectives and values, whether economic social or aesthetic shoul

Dual of the lpp, the dual form of the following lpp min z=3x1+2.5x2 constra...

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0

Li, line drawn as Y=C+1075x, when x was 2, and y was 239, given that y inte...

line drawn as Y=C+1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residualon..

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

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

Modi, history of modi

history of modi

WEITING MODEL(QUEUING), CONSIDER A BARBER SHOP WITH ONE CHAIR, ONE BARBER A...

CONSIDER A BARBER SHOP WITH ONE CHAIR, ONE BARBER AND NO ROOM FOR CUSTOMER TO WAIT. IF THE CHAIR IS EMPTY WHEN THE CUSTOMER ARRIVES,HE ENTER THE SHOP AND HIS HAIR CUT BEGINS. IF TH

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