linear programming problem, 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 problem

Disadvantages of mean deviation - measure of dispersion, Disadvantages of ...

Disadvantages of Mean Deviation a.Mean deviation ignores  the algebraic  signs of the deviations and  such it is  not capable  of further algebraic  treatment. b.It is  no

Linear programming problem, #Solve the following Linear Programming Problem...

#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

Why two regression lines - correlation regression analysis, Why Two regress...

Why Two regression Lines Once regression line  cannot  minimize the sum  of square of deviations  for both  the x and Y series  unless the relationship  between  them  indicat

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

Histogram and historigram, #qudistinguish between histogram and historigram...

#qudistinguish between histogram and historigram estion..

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

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

Operations research, state phases of operations research and and their impo...

state phases of operations research and and their importance in solving problems

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