linear programming problem, Operation Research

Assignment Help:

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.

Related Discussions:- linear programming problem

Determining sample size for estimating poportions, Determining Sample Size ...

Determining Sample Size for Estimating poportions It is necessary to determining the sample size for a problem involving proportions. This deals with the percentage of f

Complexity - necessity of operations research, In a big industry the numbe...

In a big industry the numbers of factors influencing a decision have increased situation has become big and complex because these factors interact with each other in complica

Inability of nih, Inability of NIH, FDA, to Identify Conflict of Interest ...

Inability of NIH, FDA, to Identify Conflict of Interest While federal regulations require that researchers receiving NIH grants remain free of financial conflicts of interest,

LPP, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

Operations research 2, management wants to know how many supervisors should...

management wants to know how many supervisors should be hired, and what could be the optimum workload distribution to be applied, given a number of constraints

Chi square test as a test of homogeneit, Chi Square Test as a Test of Homog...

Chi Square Test as a Test of Homogeneit The X 2 test of homogeneity is an extension of the chi square test of independence of attributes. It is designed to determine whet

Linear programming , Solve the following Linear Programming Problem using S...

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

Solution transportation problem, asm-method

asm-method

lp-model and markov decision problem, The supply of a certain good is insp...

The supply of a certain good is inspected periodically. If an order is placed of size x >0 (integer), the ordering costs are 8+2. x. The delivery time is zero. The demand is stoc

Two handed process chart of signing a latter, Two Handed process Chart of S...

Two Handed process Chart of Signing a Latter A multiple activity chart records the related sequence of activities of more than one subject, men and / or machine o

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages