LPP, 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 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/16/2013 2:48:58 AM | Location : USA







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

Write discussion on LPP
Your posts are moderated
Related Questions
Normal 0 false false false EN-IN X-NONE X-NONE

Scope of the OR techniques can be derived in followings various importance fields: 1. In Agriculture : With the explosion of population and consequent shortage of food O

Government Documents: Government  publications are the official documents brought out at government expense. They are the records of activities of the (1) Executive, (2) Legis

Royce A. Singleton and Bruce C. Straits have said that scientific social research consists of the process of formulating and seeking answers to question about the social wor

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.

3 In a rectangular game, pay-off matrix of player A is as follows:

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

advantage of quality circle process

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