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/14/2013 1:44:19 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
how i do project in linear programming

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

Reports: Report literature is an important primary source of information, particularly  for a research library. This new  medium for communication of information came into bei

Graphical Solution Procedure sample assignment and solved questions, free examples and solved homework samples for Graphical Solution Procedure in operation research. Question

Question: (a) Distinguish between (i) a single-channel and a multiple-channel waiting line; (ii) a birth and a death process with regard to queueing theory. (b) Explain

Operation research is only a Tool of Analysis and Not the Complete Decision making Process: It should always be kept in mind that O. R alone cannot make the final decision . it

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

Introduction to Probability Distribution By  theoretical distribution we mean  a frequency distribution  which  is obtained  in relation to a random  variable by some  mathem

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

Dynamic programming may be considered thoutgrowth of mathematical programming and involves the optimization of multistage( sequence of inter related decisions) decision process