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

Models in operation research, models in operation research

models in operation research

Quality circles, advantage of quality circle process

advantage of quality circle process

Linear programming, Ask question #Minimum 100 words acceptNas food produces...

Ask question #Minimum 100 words acceptNas food produces to kinds of popular dark chocolate bars. the banana and coffee. the banana bar costs 0.22 to make and sells of 0.35, where a

Linear programming problem, Solve the following Linear Programming Problem ...

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

Operation research model, methods for solving operation research models

methods for solving operation research models

Mr Diwakar, A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ., X AND Y. BECAUS...

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

requirements and characteristics of a good table , Requirements and Charac...

Requirements and Characteristics of a good table In the words of Mr. Harry Jerome a good statistical table is a triumph of ingenuity and technique masterpiece of economy o

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

LPP, Solve the following Linear Programming Problem using Simple method. Ma...

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

Sequencing problem, What is the optimum solution

What is the optimum solution

Write Your Message!

Name

Email id

Message

Verfication Code

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

Submit Assignment

User Account

All Pages