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

Methods of calculation of standard deviation , Methods of calculation of ...

Methods of calculation of standard deviation a. Calculation of Standard Deviation - Individual Series: There are two methods of calculating standard deviation in an ind

Trade literature - classification of documents, Trade Literature: Trad...

Trade Literature: Trade literature consists of documents that give information on the processes and materials involved in the manufacture of a product, various types of produc

Correlation - correlation & regression analysis, Normal 0 false...

Normal 0 false false false EN-IN X-NONE X-NONE

Scope, Scope of operations research

Scope of operations research

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

User groups - information resources, User Groups: The next step would ...

User Groups: The next step would be to identify more specifically the potential user groups. This may be done on the basis of interviews, questionnaires, study of organisation

Factory act, what is factory act

what is factory act

Maps, Maps, Atlases and Globes: Maps illustrate the distribution of ma...

Maps, Atlases and Globes: Maps illustrate the distribution of many things that occur on the surface of the earth. Information is presented by the use of a vast array of symbol

Simplex method, Solve the following Linear Programming Problem using Simple...

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

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