LPP, Operation Research

Assignment Help:
A paper mill prouduces two grads of paper viz., X and Y. Becouse of raw material restriction, it cannot product more then 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 200 and 500 per ton of grade Xand Y paper respectively. Formulate this as a Linear programming problem

Related Discussions:- LPP

#title scope.., scope of the operation research in modern management?

scope of the operation research in modern management?

Integer programming, An integer programming problem is identical to a linea...

An integer programming problem is identical to a linear programming problem except that one or more decision variables are constrained to take integer values. Such problems cannot

Tower of hanoi problem, Step 1: Research Towers of Hanoi problem The Tow...

Step 1: Research Towers of Hanoi problem The Towers of Hanoi is a problem frequently used to teach recursive programming techniques. Step 2: Run the assembly code from Hanoim

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

Title page - report writing presentation, Title  Page Tthe title page...

Title  Page Tthe title page  should  indicate  the topic  on which  the report has been  prepared the  person  or agency who has  prepared it the  person  a agency for whom it

Study the case and provide an alternative compensati, #queStudy the case an...

#queStudy the case and provide an alternative compensation design, which would redress the problem faced by the two- wheeler major in Chennai.stion..

Closed loop, Write a note on tracing a closed loop. What are the characteri...

Write a note on tracing a closed loop. What are the characteristic features of a closed loop?

Solve by simplex method, Solve by simplex method Maximize Z = 5...

Solve by simplex method Maximize Z = 5x 1 + 3x 2 Subject to 3x 1 + 5x 2 ≤ 15 5x 1 + 2x 2 ≤ 10 &         x 1 ≥ 0, x 2  ≥ 0 [Ans. Max Z = 235/19

Complexity - necessity of operations research, In a big industry the numbe...

In a big industry the numbers of factors influencing a decision have increased situation has become big and complex because these factors interact with each other in complica

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