QNT, 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:- QNT

Precentile - measure of central tendency , Normal 0 false fal...

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

LPP, A paper mill prouduces two grads of paper viz., X and Y. Becouse of ra...

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

Two handed process chart of signing a latter, Two Handed process Chart of S...

Two Handed process Chart of Signing a Latter     A multiple  activity  chart  records the related  sequence of activities  of more  than one subject, men  and / or  machine  o

Operation research, A paper mill produces two grades of paper viz., X and Y...

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

Sequencing models, The sequencing problems arises whenever there is probl...

The sequencing problems arises whenever there is problems in determining the sequence ( order) in which a member of tasks can be performed by a number of service facilities su

ANSWER OF PROBLEM RELATING TO PERT AND CPM., ANSWER OF ACTIVITY WITH THEIR ...

ANSWER OF ACTIVITY WITH THEIR PRECEDING ACTIVITY AND DURATION OF TIME IN WEEKS?

Least cost method of transportation model, how do you calculate using this ...

how do you calculate using this method where the least cost appears twice

SIMPLEX METHOD, Solve the following Linear Programming Problem using simple...

Solve the following Linear Programming Problem using simple method Maximize Z= 3x1 + 2x2 Subject to the constraints: X1 + X2 = 4

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