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 1.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 grade Y respectively. Formulate this as a linear programming problem.

Related Discussions:- Linear Programming Problem

Least cost method , definitions procedure and example

definitions procedure and example

Conclusions and recommendations , Conclusions and Recommendations Con...

Conclusions and Recommendations Conclusions should be drawn with direct reference to the objectives of the study. The readers should be able to read the objectives. T

Research methodology, In research methodology we not only discuss the res...

In research methodology we not only discuss the research methods but also consider the logic behind the method we use in the context of our research study and explain wh

LINEAR PROGRAMMING, A DRUG MANUFACTURER produces 2 products X1 and X2.X1 ne...

A DRUG MANUFACTURER produces 2 products X1 and X2.X1 needs 2 hours on machine A AND 2 HOURS ON MACHINE B.X2 needs 3 hours on machine A and 1 hour on machine B.If machine A can run

Characteristics of good average, Characteristics of Good Average a. ...

Characteristics of Good Average a. It should be Rigidly Defined An average should be rigidly defined so that there is no confusion in regard to its meaning and con

Sequensing problem, job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10...

job- 1 2 3 4 5 6 7 t1- 3 12 15 6 10 11 9 t2- 8 10 10 6 12 1 3

Linear programming model, formulate the linear programming model of the tab...

formulate the linear programming model of the table above

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 ..

Purchasing, need of detailed information about the topic

need of detailed information about the topic

Cpm/pert, how to make an attractive assignment

how to make an attractive assignment

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