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

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

Table of contents The tables  of contents  is an outline  of the order  of the chapters sections and  sub  section  with their  respective  pages. If  report  includes  a n


Periodical Article A periodical is a publication that is  published  periodically like  a newspaper a magazine  and a journal. Usually  periodicals have  volume numbers  and n

Question: (a) A company sells three different products X, Y and Z. The company makes a profit of Rs. 35, Rs. 50 and Rs. 60 per unit on products X, Y and Z respectively. The th

Sequential Samplin The previous  has shown  that the sampling  units  were drawn  prior  to the drawing of the actual   sample  and has  a fixed  size. But the  sequential  sa

words each) Q2. 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 ha

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.

Q3. 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