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

Summary report - report writing presentation, Summary Report The r...

Summary Report The report format suggested above does not contain any summary section. This exclusion is deliberate. The summary should not be prepared until t

Experimental design and methodology , Case Study - Experimental Design ...

Case Study - Experimental Design Dental Clinic A leading dental clinic with three well qualified dentists is seriously considering keeping in touch with its pat

Uncertainly, Uncertainly : There is a great uncertainly about economic a...

Uncertainly : There is a great uncertainly about economic and general environment. With economic growth uncertainty is also growing's. this makes each decisions costlier

Operation research, A Company produces 150 cars. But the production rate va...

A Company produces 150 cars. But the production rate varies with the distribution. Production Rate Probability 147 0.05 148 0.10 149 0.15 150 0.20 151 0.30 152 0.15 153 0.05 At pre

Merits - correlation regression analysis , Merits a.It is simple to ...

Merits a.It is simple to understand and easy to calculate. b.It is very useful in the case of data which are of qualitative nature like intelligence honesty be

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

Solved the question, #questionthe following Linear Programming Problem usin...

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

Short question, write down any two assumption of L.P

write down any two assumption of L.P

Census method, Census Methods Complete Enumeration: If detail informat...

Census Methods Complete Enumeration: If detail information regarding every individual person or item of a given universe ( or population ) is collected then the enquir

Goal programming, A farmer in the Midwest has 1,000 acres of land on which ...

A farmer in the Midwest has 1,000 acres of land on which she intends to plant corn, wheat, and soybeans. Each acre of corn costs $100 for preparation, requires 7 worker-days of la

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages