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

LPP, Solve the following Linear Programming Problem using Simple method. Ma...

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

Probability distribution , Normal 0 false false false E...

Normal 0 false false false EN-IN X-NONE X-NONE PROBABILITY DISTRIBUTION

OR, What is the role of decision making in OR

What is the role of decision making in OR

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

Simplex solution, difference between simplex solution procedure for maximis...

difference between simplex solution procedure for maximisation and minimisation

Compute the joining, The Best Corporation is considering making either mino...

The Best Corporation is considering making either minor or major repairs to a malfunctioning production process.  When the process is malfunctioning, the percentage of defective it

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

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

Identify and comment on cultural similarities, You are required to analyse ...

You are required to analyse the case study, as indicated under these headings: 1. Identify FIVE persons, bodies, organisations or groups in the case study. 2. For EACH of the

Problems based on lpp when feasible region is a line segment, Problems base...

Problems based on LPP when feasible region is a line segment or it does not exist. 1.    Maximize z = 2x+3y subject to the constraints X + y ≤ 1 X + y ≥ 3 X,  y ≥ 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