Assignment question. please give me the solution, 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:- Assignment question. please give me the solution

Describe the demand curve, The following equation gives Jane's linear deman...

The following equation gives Jane's linear demand curve for visits to a nearby national park. Q is the number of visits per week and P represents the price of a pass (price per vi

Scope, Scope of operations research

Scope of operations research

Linear programing, Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly ...

Maximize6x1+8x2+5x3,st,labour3x1+4x2+5x3 =0 then brefly explain x1,x2,x3;term labour,metal&plastic;the160hours;x1,x2&x3>=0

U.S. Healthcare Timeline, 500 word summary written in third person on predi...

500 word summary written in third person on predictions of how current healthcare reform polocies will impact the future of healthcare

Significance, significance of operation research in modern management

significance of operation research in modern management

Linear programming, . A paper mill produces two grades of paper viz., X and...

. 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

Lpp, . 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 pape

Question, Solve the following Linear Programming Problem using Simple metho...

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

Periodical article - report writing presentation , Periodical Article ...

Periodical Article A periodical is a publication that is published periodically like a newspaper a magazine and a journal. Usually periodicals have volume numbers and n

Graphs of time series, Graphs of Time Series A time series is a sequ...

Graphs of Time Series A time series is a sequence of values corresponding to successive points of time. Time series are graphed with time on the x axis and the oth

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages