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

Z-test - hypothesis testing, Z-Test Prof. Fisher has given a method of...

Z-Test Prof. Fisher has given a method of testing the significance of the correlation coefficient in small samples. According to this method the coefficient of correlation

Markert reseach, The Upjohn Company, based in Kalamazoo, Michigan, manufact...

The Upjohn Company, based in Kalamazoo, Michigan, manufactures and markets pharmaceuticals and health-related products. With more than 19,000 employees and distribution in over 30

Scope of operation research, scope of operation research in management

scope of operation research in management

Model building, Model building is the essence of the operations research ap...

Model building is the essence of the operations research approach? Discuss. question #Minimum 100 words accepted#

Basis of scientific methods, The scientific methods is based on certain...

The scientific methods is based on certain article of path these are: 1. Reliance on Evidence: Truth is established on the basis of evidence. Conclusion is admitted onl

Assignment problems, a practical example

a practical example

QUANTITATIVE ANALYSIS, Ask queA manufacturing firm has discontinued product...

Ask queA manufacturing firm has discontinued production of a certain unprofitable product line. This created considerable excess production capacity. Management is considering to d

Sequencing problem, how do you use gantt chart for solving sequencing probl...

how do you use gantt chart for solving sequencing problem ? why is it not employed for solving larger problems?

Solve lpp by using its duality, Maximize w = 5x -2y +3z subject to 2x +2y -...

Maximize w = 5x -2y +3z subject to 2x +2y -z>=2 y + 3z

Dynamic programming models, Dynamic programming may be considered thoutgr...

Dynamic programming may be considered thoutgrowth of mathematical programming and involves the optimization of multistage( sequence of inter related decisions) decision process

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