fromulation of LPP, 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 ot grade Y paper in a week. there are 160 prodection hours in a week. it requires 0.20 and 0.04 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 linea programming problem.

Related Discussions:- fromulation of LPP

Evolutionary methods, This methods studies development from simpler forms...

This methods studies development from simpler forms through a long series of a small change. Each change by itself results in minor modification in the phenomenon but the

Investigate the link between engine wear and mileage, The Association of Ma...

The Association of Malawi Mechanics has commissioned a study to investigate the link between engine wear and mileage. The main focus of the study is to determine whether the mileag

Dina, Construct a two-variable LP model that: · Maximizes Z; · ...

Construct a two-variable LP model that: · Maximizes Z; · All coefficients in the objective function are greater than 500; · Includes at least 5 constraints;

LLP Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0 on..

Techniques of work measurement, Techniques  of Work  Measurement A n...

Techniques  of Work  Measurement A number of work  measurement  techniques  have been  developed  to suit  different  types of work . There are: 1. Repetitive work: The

Network problem, Consider the following network where the value on each arc...

Consider the following network where the value on each arc represents the capacity of that arc. Use the augmenting path algorithm to find the value of the maximum flow from node 1

LPP, USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJE...

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

One tailed and two tailed tests -hypothesis testing , Normal 0 ...

Normal 0 false false false EN-IN X-NONE X-NONE

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