Formulate this as a 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:- Formulate this as a Linear Programming Problem

Research process and methodology , Case Study - Research Process Tomz...

Case Study - Research Process Tomzak and Hale inc was a medium sized marketing research firm located in a large mind western city. Bob Lynn a marketing vice president

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

Annotated bibliography - report writing presentation , Annotated bibliograp...

Annotated bibliography In this bibliography each is followed by a one sentence or one paragraph description of the content of the work cited. For example Bndypad

#title.definition of graphical method ., full detailor theory on graphical ...

full detailor theory on graphical method

Techniques of work measurement, Techniques of Work Measurement A n...

Techniques of Work Measurement A number of work measurement techniques have been developed to suit different types of work . There are: 1. Repetitive work: The

Linear programming problem, A paper mill produces two grades of paper viz.,...

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

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

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

Techniques, explain the different techniques as operation research

explain the different techniques as operation research

Linear programming, maximize z=3x1+2*2 subject to the constraints x1+x2=4 x...

maximize z=3x1+2*2 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