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

Linear problem, #q A paper mill produces two grades of paper viz., X and Y....

#q 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 pape

Model., is model the essence of oprational research.

is model the essence of oprational research.

Characteristics of good average, Characteristics  of Good Average a. ...

Characteristics  of Good Average a. It should  be Rigidly  Defined  An average should  be rigidly defined so that  there is  no confusion  in regard  to its  meaning  and con

Standard deviation - sampling decisons, Standard Deviation The  standa...

Standard Deviation The  standard deviation of samples (s) can be estimated by  the pilot  study past studies and the  ranges of distribution. A pilot study  may be  conducted

Linear Programming Problem, A paper mill produces two grades of paper viz. ...

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

Dual of the lpp, the dual form of the following lpp min z=3x1+2.5x2 constra...

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0

Non parametric tests - hypothesis testing, NON PARAMETRIC TESTS All  ...

NON PARAMETRIC TESTS All  practical  data follow normal distribution under  such situations can estimate the  parameters such  as mean  variance etc ,,, and use the  standard

LP - Assignment problem, I have looked at Hungarian algorithm to solve assi...

I have looked at Hungarian algorithm to solve assignment problem, but it seems like it is limited to 1-to-1 assignment. I would like to know how to do 1-to-3 assignment.

Assignment problem, a c++ program to implement assignment problem??????????...

a c++ program to implement assignment problem???????????

Problems based on lpp when feasible region is unbounded, Problems based on ...

Problems based on LPP when feasible region is unbounded.     1.    Minimize z = 3x + 5y subject to constraints  X + y ≥ 2 X + 3y ≥ 3 X, y ≥ 0 script

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