Linear Programming , 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:- Linear Programming

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

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

Replacement, an electric company which generates and distributes electricit...

an electric company which generates and distributes electricity conducted a study on the life of poles. tha appropriate life data are given in the following table: years after inst

Organization of the study, In this project the main focus is conducted inte...

In this project the main focus is conducted interview to educational experts. This interview is base on Delphi technique. This technique is used to attain experts' consensus on ele

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

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

Linear programming, Q3. Solve the following Linear Programming Problem usi...

Q3. 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

First paper, discuss the seauencing decision problem for n jobs on two and ...

discuss the seauencing decision problem for n jobs on two and three machines

OR, Models in OR

Models in OR

#title.L.L.p, #use the simple method to solve the following L.P.P. Maximi...

#use the simple method to solve the following L.P.P. Maximize Z =4X1 +10X2 subject to constraints, 2X1 +X2 2X1+5X2 2X1 +3X2 X1,X2 > 0

Anthology or book with articles or works by many authors , Anthology or Bo...

Anthology or Book with Articles  or Works by Many Authors   The name  of the person  compiling the book  will be  given  followed  by the  word editor. For more  than one  edit

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