linear programming, Operation Research

Assignment Help:
3. 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

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

Calculation of standard deviation - continuous series, Calculation of Stand...

Calculation of Standard Deviation - Continuous Series: In the continuous series the methods of calculation standard deviation is almost the same as in a discrete frequency distrib

Linear programming problem, #Solve the following Linear Programming Problem...

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

Web based emergency operations center, You are the emergency manager for Ch...

You are the emergency manager for Cheyenne County in a western state. Cheyenne County is located mid-way between two major urban areas and has historically been a rural county. The

Determination of effectiveness measures, Determination of effectiveness Mea...

Determination of effectiveness Measures: Effectiveness measure is a measure of success of a model in representing a problem and providing a solution. It is the connecting link

M/M/s queue, How do I use C# to program an M/M/s queue model?

How do I use C# to program an M/M/s queue model?

Scope, With practical example

With practical example

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

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

Operation research, Discuss the methodology of operation research

Discuss the methodology of operation research

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