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

OPERATION RESEARCH, 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

Medical industry payments to physicians, Medical Industry Payments to Physi...

Medical Industry Payments to Physicians The relationships between physicians and medical related companies in the United States, generally acknowledged to be familiar given th

Set of pareto optimal policies, Problem: A policy maker is considering seve...

Problem: A policy maker is considering several policy options that lead to different utility levels of different individuals a) Which Policy is would be optimal according t

Simple size -sampling decisions, simple Size When a survey  is underta...

simple Size When a survey  is undertaken and  it is not  possible  to cover  the entire population, the marketing  researcher has to  answer a basic  question  - how  large  s

Calculate, A paper mill produces two grades of paper viz X and Y. Because o...

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

LPP, 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, Solve the following Linear Programming Problem using Si...

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

LPP Sum, A paper mill produces two grades of paper viz., X and Y. Because o...

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

Markov chain models - operation research model, These models are used for a...

These models are used for analyzing a system which changes over a period of time among various possible outcomes or states. The models while dealing with such systems describe tra

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