plz get the ans , Operation Research

Assignment Help:
#questioA 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 Problemn..

Related Discussions:- plz get the ans

Answer, 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

MODERN MANAGEMENT, DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH...

DISCUSS THE SIGNIFICANCE AND SCOPE OF OPERATION RESEARCH IN MODERN MANAGEMENT

Markov analysis, The town of Silverton, Colorado, has three gasoline statio...

The town of Silverton, Colorado, has three gasoline stations, Shell, Exxon, and Arco. Customer selection of service stations can be modeled as a Markov process, with the following

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

Weaning and definition, Weaning  and Definition A systematic  arrange...

Weaning  and Definition A systematic  arrangement of classified  data in labelled columns and  rows  is  known  a statistical table. Turtle has given  a comprehensive defin

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

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

Simple graph-correlation and regression analysis, Simple Graph The val...

Simple Graph The values of the two variables are plotted on a graph paper. We get two curves one for x variables and another for y  variables. These  two curves reveal the dir

Simplex method, Solve the following Linear Programming Problem using Simple...

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

Study the case and provide an alternative compensati, #queStudy the case an...

#queStudy the case and provide an alternative compensation design, which would redress the problem faced by the two- wheeler major in Chennai.stion..

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