linear programmimg, Operation Research

#questionA 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/23/2013 6:47:47 AM | Location : USA







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

Write discussion on linear programmimg
Your posts are moderated
Related Questions
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

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X 1, X2 = 0

Inability of NIH, FDA, to Identify Conflict of Interest While federal regulations require that researchers receiving NIH grants remain free of financial conflicts of interest,

Drury's Principles: The basic principle, which still governs the selection of reading material for a library, was enunciated by Drury  in 1930. It states: "To provide the righ


High Costs are Involved in the Use of O. R Techniques: O. R techniques usually prove very expensive. Services of specialized persons are invariably called for ( and along w

mile-high microbrewery makes a light beer and a dark beer. mile-high has a limited supply of barley, limited bottling capacity, and a limited market for light beer. profits are $0.

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

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0