Linear Programming Problem, 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 1.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 grade Y respectively. Formulate this as a linear programming problem.
Posted Date: 2/17/2013 6:39:16 AM | Location : USA







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

Write discussion on Linear Programming Problem
Your posts are moderated
Related Questions
Chi Square Test for Independence  of Attribute The chi square  test  can be  used to find out  whether two  or more attributes are associated or not. This  test helps  in fin

Question 1 Explain the process of problem identification with an example 2 Interview method involves a dialogue among the Interviewee and the Interviewer. Describe the inter

An electro-mechanical product for use in a vehicle has been in widespread use for some time and has proved popular with customers, in terms of its operational performance and price

Test Statistic The next  step is compute an appropriate  test statistic which  is based on an appropriate probability distribution. It  is used to test whether the null  hypo

A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ, X AND Y. BECAUSE OF RAW MATERIALS 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 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 i


SOLVE THE FOLLOWING LP USING SIMPLE METHOD MAXIMIZE Z=3X1+2X2 SUBJECT TO CONSTRAINT X1+X2 X1-X2 X1,X2>=0