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

Mb0048, A paper mill produces two grades of paper viz., X and Y. Because of...

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 i

Classification of documents by information characteristics , Classification...

Classification of documents by information Characteristics: The schemes of classification advocated by Hanson and Grogan are mainly based on the information characteristics of

Answering questions for minimum spanning tree problems, Sample Assignment f...

Sample Assignment for minimum spanning tree problems For the subsequent graph get the minimum spanning tree. The numbers on the branches presents the cost.

LPP, A paper mill produces two grades of paper viz. X and Y. Because of raw...

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

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

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

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

Determine the optimal assignment, Six Operators are to be assigned to five ...

Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignment

Line balancing, what will happen when line balance doesn not exist

what will happen when line balance doesn not exist

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