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/15/2013 4:11:34 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
Scattered Responsibility and Authority: In a big industry responsibility and authority of decisions making is scattered throughout the organization and thus the organization.

A certain type of machine breaks down at an average rate of 5/hour. the break down is in accordance with Poisson process.cost of idle machine hour is $15/hour. 2 repairmen Peter an

Operation reac Involves the use of mathematical models, equations and similar other mathematical expressions. Assumptions are always incorporated in the derivation of an equa

krr emee ee

Ask questiAvatars are virtual characters that can be used as representatives of a company that is using the Internet as a distribution channel. For instance, avatars can be used as

Question: Spencerville Products is expanding its operations west of the Mississippi.  Its first step is to build a manufacturing facility in Denver to satisfy demand on the W

Question 1 Explain Pre-Store opening activities and State at least 10 pre-store opening activities that should be ideally carried out in a retail store? Question 2 What ar

POSSON DISTRIBUTION   In binomial  distribution the value of n was  finite. But  there are few  problems  when  cannot  be estimated. So in these  binomial  distribution

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

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