linear programming problem, Operation Research

Assignment Help:
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 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

Operations Research, a. What do you mean by linear programming problem? Exp...

a. What do you mean by linear programming problem? Explain the steps involved in linear programming problem formulation? b. A paper mill produces two grades of paper viz., X and Y.

Properties of normal distribution - probability distribution, Properties of...

Properties of Normal Distribution a.It is a continuous  probability  distribution having  parameters m and . b.The normal  curve is perfectly symmetrical about  the mean (

Linear pograming, application area of linear programing problem

application area of linear programing problem

Linear proramming , 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

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

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

. 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

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

Rank sum test the mann whitney u - test, RANK SUM TEST THE  MANN WHITNEY U...

RANK SUM TEST THE  MANN WHITNEY U - TEST Mann  Whitney u test is an alternative to the  samples  test. This  test is based  on the ranks  of the  observation of two samples pu

Ge, Ask question #Minimum 100 words what can engineer planner do in métallu...

Ask question #Minimum 100 words what can engineer planner do in métallurgie accepted#

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..

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