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

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

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

Scope, explain the significant and scope of operation research in scientifi...

explain the significant and scope of operation research in scientific management

Answer, A paper mill products two grade of paper viz., X & Y. Because of ra...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

A paper mill produces, . A paper mill produces two grades of paper viz., X ...

. 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

Observation and data collection - research phases, Observation and Data Col...

Observation and Data Collection for Better Understanding of the Problem: Many times actual observations by trained observers at the scene of operation may be difficult and da

LPP., A constraints in an LPP restricts? (Value of objective function,Value...

A constraints in an LPP restricts? (Value of objective function,Value of decision variable,Use of available resources, uncertainty of optimum value) please help me to find out righ

Lpp, Determine feasible space for x1-x2= 8

Determine feasible space for x1-x2= 8

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

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

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

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