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

Periodical article - report writing presentation , Periodical Article ...

Periodical Article A periodical is a publication that is  published  periodically like  a newspaper a magazine  and a journal. Usually  periodicals have  volume numbers  and n

Mba, in a rectangular game ,pay of matrix of player A is as follows

in a rectangular game ,pay of matrix of player A is as follows

Attitude measurement and methodology , Case Study  - Attitude Measurement ...

Case Study  - Attitude Measurement National Kitchens For  several years  the management  of national kitchens a diversified packaged foods manufacturer  had been  watch

Post-optimal analysis, It can be seen from the optimal solution for the fou...

It can be seen from the optimal solution for the foundry problem that two resources, raw material-1 and labor, are exhausted whereas the other two resources, raw materi

Lpp, A paper mill produces two grades of paper viz., X and Y. Because of ra...

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

LPP Sum, A paper mill produces two grades of paper viz., X and Y. Because o...

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

Solve by computational procedure of big – m method, Example 2 Max Z = 3...

Example 2 Max Z = 3x 1 - x 2 Subject to             2x 1 + x 2 ≥ 2             x 1 + 3x 2 ≤ 3             x 2 ≤ 4     &     x 1 ≥ 0, x 2  ≥ 0   A

Dynamic programming, A company is planning its advertising strategy for the...

A company is planning its advertising strategy for the next year for its three major products.

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