i need answer for the below question, 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:- i need answer for the below question

#title. solution, Solve the following Linear Programming Problem using Simp...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

Application Areas of Linear Programming, what is meant by Application Areas...

what is meant by Application Areas of Linear Programming?

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

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

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

OR, Models in OR

Models in OR

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

Sample size in non propbability- sampling decisions, Sample Size in Non Pro...

Sample Size in Non Propbability The probability selection does not apply to purposive selection. The size of the non probability samples is selected in a subjective ma

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

Solve the following Linear Programming Problem using Simple , Solve the fol...

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

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