LPP FORMULATION., 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:- LPP FORMULATION.

35mm slider -report writing presentation , 35mm Slider  35 mm Slider l...

35mm Slider  35 mm Slider like OHP transparencies casts  an images but they  have different  uses and  properties. They are used  to show an actual photographic  images in the

Linear programming, Use Big M method to Maximize(Z)=3_(x_1 )+2_(x_2 ) Subj...

Use Big M method to Maximize(Z)=3_(x_1 )+2_(x_2 ) Subject to 3_(x_1 )+?1.5?_(x_2 )=30 x_1+x_2=20 x_1=0 x_2=0

Ans, 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

PERT, how does it work

how does it work

Mr Diwakar, A PAPER MILL PRODUCES TWO GRADES OF PAPER VIZ., X AND Y. BECAUS...

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

Game Theory, Task1:- A company is currently involved in negotiation with it...

Task1:- A company is currently involved in negotiation with its union on the upcoming wage contract. Positive signs in the table represent wage increase while negative sign represe

Markov analysis, The town of Silverton, Colorado, has three gasoline statio...

The town of Silverton, Colorado, has three gasoline stations, Shell, Exxon, and Arco. Customer selection of service stations can be modeled as a Markov process, with the following

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 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