LPP FORMULATION., 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: 1/31/2013 12:24:51 AM | Location : USA







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

Write discussion on LPP FORMULATION.
Your posts are moderated
Related Questions
#question. 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 grad

This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with

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 have no assignm

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

INFORMATION AND OTHER RELATED CONCEPTS - THEIR MEANING AND CHARACTERISTICS: You may often hear or read in newspapers and other popular magazines about "exponential growth of i

Tentative explanations when formulated as propositions are called hypotheses. It is very important to state the hypothesis and its anticipated consequences before star

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

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

Mode  of Presentation A strategy  needs to be  chalked out for  a satisfactory  rendering of the  topic. The  man oeuvres are going  t vary  with a  change in the  manner  of

on which basis we take value in time out time in column?