Linear Programming 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 1.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 grade Y respectively. Formulate this as a linear programming problem.
Posted Date: 2/17/2013 6:39:16 AM | Location : USA







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

Write discussion on Linear Programming Problem
Your posts are moderated
Related Questions
Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

Question: Spencerville Products is expanding its operations west of the Mississippi.  Its first step is to build a manufacturing facility in Denver to satisfy demand on the W

discuss applications and scope of operations research in diverse areas.

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

MEAN DEVIATION Mean  deviation of a series is the arithmetic  average of the  deviations of various  items  from the  median  or mean  of that series. Median is preferred

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

What is The proper meaning of action phase will u help me to lern it in deeply????

Why Two regression Lines Once regression line  cannot  minimize the sum  of square of deviations  for both  the x and Y series  unless the relationship  between  them  indicat

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

discuss the seauencing decision problem for n jobs on two and three machines