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

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

Model., is model the essence of oprational research.

is model the essence of oprational research.

De, describe the similarities and differences of transportation and linear ...

describe the similarities and differences of transportation and linear programing methods

Phase of operation research, The scientific method in O R study generall...

The scientific method in O R study generally involves the followings three phases: 1. Judgment phase, 2. Research phase 3. Action phase

Mean deviation - measure of dispersion, MEAN DEVIATION Mean  deviati...

MEAN DEVIATION Mean  deviation of a series is the arithmetic  average of the  deviations of various  items  from the  median  or mean  of that series. Median is preferred

Methods of scientific research, Methods is a tool or a techniques used t...

Methods is a tool or a techniques used to collect data. It is procedure for obtaining knowledge based on empirical observation and logical reasoning. Field Study Metho

Regression equations - correlation regression analysis, Regression Equation...

Regression Equations The   regression equations express the regression line. As there are two regression lines so there  are two  regression  equations. The regression equatio

Vam, how to solve it

how to solve it

Vogel approximation methods, This method is more  systematic and orderly th...

This method is more  systematic and orderly than least cost method. Here penalties for each column and row of the transportation table are determined, and the row  or  column with

Simplex method, Maximize Z =3x+4x subject to x1+x2 =3 2x1+3x2 =4 x1,x2 =0

Maximize Z =3x+4x subject to x1+x2 =3 2x1+3x2 =4 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