Assigment , Operation Research

Assignment Help:
b. 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:- Assigment

Analyse the average number and mean number, Consider the closed network of ...

Consider the closed network of the following figure. The number at the arrows give the transition probabilities for a customer leaving the queue to route to a subsequent queue. Eve

Purchasing power of customers, This is determined by disposable personal ...

This is determined by disposable personal income( personal income minus direct taxes and other deductions ). Some people suggest the use of discretionary income in place of

Llp, Solve the following Linear Programming Problem using Simple method. Ma...

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

Stepping stone method, This is a  procedure of determining  the potential i...

This is a  procedure of determining  the potential if any for improving each  of the non basic variables in terms of the objective function. To determine  this  potential  each of

Calculation of ranks correlation , Calculation of Ranks Correlation W...

Calculation of Ranks Correlation Where Ranks  are Given: When the  actual  ranks  are given  the steps  followed are: a.Compute  the difference  of the  two ranks  (R1 and

Lcd projectors - reoprt writing presentation , LCD Projectors  LCD...

LCD Projectors  LCD projectors  are several  steps  ahead of conventional OHPs. These  projectors  are more  compact  and more  powerful  and can  be directly  linked to a

Linear programming, Solve the following Linear Programming Problem using Si...

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

Simplex, Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4...

Maximize Z = 2x - 7y subject -2x + 3y = 3 4x + 5y >= 10 6x + 7y 4x + 8y >= 5

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