Answer, 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:35:31 AM | Location : USA







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

Write discussion on Answer
Your posts are moderated
Related Questions
a. Determine the following with respect to decision making approaches: (i) Group decision making (ii) Directive, analytic, conceptual and behavioral decision making styles (8

ANSWER OF ACTIVITY WITH THEIR PRECEDING ACTIVITY AND DURATION OF TIME IN WEEKS?

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Solved LP Sample Assignment & Questions A person desires to decide the ingredients of a diet which will satisfy his routine necessities of fats, proteins, and carbohydrates at

Demerits  of Range a.It gives  importance  to the  two  extreme  values and is very much affected by the extreme items. b.The range  provides  no information  about the  st

maximize z=3x1+2x2 subgect to the constraints x1+x2 x1-x2 x1,x2>_0

Construct a two-variable LP model that: · Maximizes Z; · All coefficients in the objective function are greater than 500; · Includes at least 5 constraints;

Dual formulation is done for a number of reasons. The solution to a Dual problem provides all essential information about the solution to the Primal problem. A so

in a rectangular game ,pay of matrix of player A is as follows

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment