linear programing, 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 programing

Linear Programming, b. A paper mill produces two grades of paper viz., X an...

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

Mb0048, A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ, X AND Y. BECAUSE OF ...

A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ, X AND Y. BECAUSE OF RAW MATERIALS RESTRICTIONS, IT CANNOT PRODUCE MORE THAN 400 TONS OF GRADE X PAPER AND 300 TONS OF GRADE Y PAPER I

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

A, what operation research analysts do not

what operation research analysts do not

Mathematical Model, What is meant by a mathematical model of a real situati...

What is meant by a mathematical model of a real situation? Discuss the importance of models in the solution of Operations research problems

Describe the service tax law in usa and concept of negative, Question 1 ...

Question 1 X Ltd. has Unit C which is not functioning satisfactorily. The following are the details of its fixed assets: Asset Date of acquisiti

Operations research, six operators are to be assigned to the 5 jobs with th...

six operators are to be assigned to the 5 jobs with the cost of assignments

Optimization, Find a minimum cost spanning arborescence rooted,

Find a minimum cost spanning arborescence rooted,

Mk, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Write Your Message!

Captcha
Free Assignment Quote

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd