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

#transportation and linear models.., #what is the similarity and difference...

#what is the similarity and differences between transportation and linear programing models?

Simplex method LPP, #questioA paper mill produces two grades of paper viz.,...

#questioA 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

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

What are artificial variable why do you need them

Inventory control of any company, give real data & find out the inventory &...

give real data & find out the inventory & give suggestions

Application of operation reserch., how i make project report on "applicatio...

how i make project report on "application of or".i want help from you.can you give me idea to complete this report..

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

Simplex method, Solve the following Linear Programming Problem using Simple...

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

Both LP and PIP, marginal rate of substitution, degeneracy and degenerate ...

marginal rate of substitution, degeneracy and degenerate solution

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

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