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.

Modi, there are 5 plants located in different cities and manufacturer a com...

there are 5 plants located in different cities and manufacturer a common produt A

Expected value analysis, Profitable Casino Corp. (PCC) is a Harrah's wannab...

Profitable Casino Corp. (PCC) is a Harrah's wannabe, intent on mimicking Harrah's analytical marketing techniques.  For example, PCC issues virtually all gamers a PCC "Rewards" car

#title. solution, Solve the following Linear Programming Problem using Simp...

Solve the following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2

Linear pograming, application area of linear programing problem

application area of linear programing problem

Sequential sampling -sampling decisons, Sequential Samplin The previou...

Sequential Samplin The previous  has shown  that the sampling  units  were drawn  prior  to the drawing of the actual   sample  and has  a fixed  size. But the  sequential  sa

test statistic - hypothesis testing , Test Statistic The next  step ...

Test Statistic The next  step is compute an appropriate  test statistic which  is based on an appropriate probability distribution. It  is used to test whether the null  hypo

Decision tree approach, Question: Spencerville Products is expanding ...

Question: Spencerville Products is expanding its operations west of the Mississippi.  Its first step is to build a manufacturing facility in Denver to satisfy demand on the W

LPP, Solve the following Linear Programming Problem using Simple method. Ma...

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

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