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

Markert reseach, The Upjohn Company, based in Kalamazoo, Michigan, manufact...

The Upjohn Company, based in Kalamazoo, Michigan, manufactures and markets pharmaceuticals and health-related products. With more than 19,000 employees and distribution in over 30

Operation reaserch, 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

Linear programing, main components of a linear programming

main components of a linear programming

Solve the following Linear Programming Problem using Simple , Solve the fol...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2

Functions and objects of statistical average , Normal 0 false...

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

LPP, A FIRM MANUFACTURES HAEDACHE PILLS IN TWO SIZE A AND B

A FIRM MANUFACTURES HAEDACHE PILLS IN TWO SIZE A AND B

Determination of the operation, An operation is a combination of different...

An operation is a combination of different actions dealing with raw materials( e, g, men and machines) which form a structure from which an action with regard to broader ob

ASSIGNMENT, #A paper mill produces two grades of paper viz., X and Y. Becau...

#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

Linear programming problem, Solve the following Linear Programming Problem ...

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

Modi method, find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 3...

find optimal solution for a 3*4 matrix 42 27 24 35 46 37 32 32 40 40 30 35 using modi method

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