#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

Ask an Expert

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

Write your message here..

Related Questions

Linear programming, 8 8

Quantitative research methods, Select one of the topics listed 1-6 below ... Select one of the topics listed 1-6 below and outline a programme of quantitative research for its investigation.  The assignment  should cover issues of sample design, instrumen

OPTIMAL ASSIGNMENT., Six Operators are to be assigned to five jobs with the... 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

Operation research, Significance of operation research Significance of operation research

Line balancing, what happen if line balancing does not exist what happen if line balancing does not exist

Simplex solution, difference between simplex solution procedure for maximis... difference between simplex solution procedure for maximisation and minimisation

Duality, Write a note on economic interpretation of dual? Write a note on economic interpretation of dual?

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

Lp, #question.Solve the following Linear Programming Problem using Simple m... #question.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.

Innovation.., identify a new technological innovation not yet commercialize... identify a new technological innovation not yet commercialized (e.g., house cleaning robotic). What are the product''s features? In your paper, explain how that technological innov