Problem, Operation Research

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.
Posted Date: 2/13/2013 11:31:41 AM | Location : USA







Related Discussions:- Problem, Assignment Help, Ask Question on Problem, Get Answer, Expert's Help, Problem Discussions

Write discussion on Problem
Your posts are moderated
Related Questions
Disadvantages of Mean Deviation a.Mean deviation ignores  the algebraic  signs of the deviations and  such it is  not capable  of further algebraic  treatment. b.It is  no

Two Handed process Chart of Signing a Latter     A multiple  activity  chart  records the related  sequence of activities  of more  than one subject, men  and / or  machine  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

Answering Question to Finding Shortest Path - Operation Research Assignment Help Finding answers for shortest path problems are quite interesting and not easy to solve. In solv

Machine  Tabulation This methods  of tabulating information  is generally used in  case of extensive  large scale  surveys. Mechanical sorting and tabulating equipments and su

ABC Company manufactures both interior and exterior paints from 2 raw materials M1 and M2. The following table gives basic data of problem.     Exterior

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

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

undertake the proposed research investigation in accordance with the agreed specification and procedures

An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot