linear programming problem, Operation Research

Assignment Help:
A paper mill produces two grades of paper viz., X and Y. Because of raw
each)
material restrictions, it cannot produce more than 400 tons of grade X paper
and 300 tons of grade Y paper in a week. There are 160 production hours in a
week. It requires 0.20 and 0.40 hours to produce a ton of grade X and Y papers.
The mill earns a profit of Rs. 200 and Rs. 500 per ton of grade X and Y paper
respectively. Formulate this as a Linear Programming Problem

Related Discussions:- linear programming problem

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

Standara deviation - measure of dispersion , STANDARA DEVIATION Standa...

STANDARA DEVIATION Standard  deviation  is the  square  root of the  arithmetic  average of  squares of all  the deviations from the  mean. In short  it may  be defined  as th

Scientific methods, Royce A. Singleton and Bruce C. Straits have said tha...

Royce A. Singleton and Bruce C. Straits have said that scientific social research consists of the process of formulating and seeking answers to question about the social wor

Lpp, Determine feasible space for x1-x2= 8

Determine feasible space for x1-x2= 8

Categories of information in social sciences, Categories of Information in ...

Categories of Information in Social Sciences: It would be useful, particularly in social sciences, to group information into three categories:  •  Statistical Information

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

Histogram and historigram, #qudistinguish between histogram and historigram...

#qudistinguish between histogram and historigram estion..

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

Least cost methods, The NW  corner  rule  described  earlier considers only...

The NW  corner  rule  described  earlier considers only  the availability  and supply  requirements  in making  assignments. It takes  no account  of the shipping  costs  given  in

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