liner, Operation Research

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 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/12/2013 11:30:45 AM | Location : USA







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

Write discussion on liner
Your posts are moderated
Related Questions
Decision making is not only the headache of management rather all of us make decisions. We daily decide about minor issues. The essential characteristics of all decisions

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

give the procedure of tracing a closed loop

This is a  procedure of determining  the potential if any for improving each  of the non basic variables in terms of the objective function. To determine  this  potential  each of

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

A paper mill produces two grades of paper viz., X & Y. Because of raw material restrictions, it cannot produce more 400 tons of grade X paper & 300 tons of grade Y paper in a week.

How to solve linear programming problems using simplex method introducing slack variable,surplus variable and artificial variable

Calculation of Standard Deviation - Continuous Series: In the continuous series the methods of calculation standard deviation is almost the same as in a discrete frequency distrib

Test Statistic The next  step is compute an appropriate  test statistic which  is based on an appropriate probability distribution. It  is used to test whether the null  hypo

difference between simplex solution procedure for maximisation and minimisation