linear programning, 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/21/2013 12:39:28 AM | Location : USA







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

Write discussion on linear programning
Your posts are moderated
Related Questions
Important of Probability The  various practical applications  of the  theory  of probability are: a.The fundamental  laws of statistic viz   the law  of statistical regular

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

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

This assignment requires you to carry out the first part of a research project on the topic of "Cross cultural communication in the workplace". You can take any approach to this to

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.

if there were n workers and n jobs there would be

discuss and explain both probability and non probability sampling techniques.

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

WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0