need answer, 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:- need answer

Lpp., Paper Mill Produces Two Grades Of Paper Viz x And y Because Of Raw Ma...

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 We

Method of calculation of mode - measure of central tendency , Method of cal...

Method of calculation of Mode Calculation  of Mode  Individual  series: For determining  mode count the  number of times the  various  values  repeat  themselves and the  va

Game theory, if there were n workers and n jobs there would be

if there were n workers and n jobs there would be

Answer, A paper mill products two grade of paper viz., X & Y. Because of ra...

A paper mill products two grade of paper viz., X & Y. Because of raw material restriction, it cannot produce more than 400 tons of grade X paper & 300 tons of grade Y paper in a we

Operations research 2, management wants to know how many supervisors should...

management wants to know how many supervisors should be hired, and what could be the optimum workload distribution to be applied, given a number of constraints

Linear programming problem, a paper mill prodecs two grades of paper viz., ...

a paper mill prodecs 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, what operation research analysts do not

what operation research analysts do not

Solved the question, #questionthe following Linear Programming Problem usin...

#questionthe following Linear Programming Problem using Simple method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 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