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

#title, WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

WHOM DO YOU THINK RAJENDER WILL EAT WITH? WHY?

Method of calculation of mean deviation, Method of Calculation of Mean De...

Method of Calculation of Mean Deviation a. Computation of Mean Deviation Individual Series : The process of computing mean deviation in case of individual series involves

Validity of the model - operation research model, Deriving the Solution fro...

Deriving the Solution from the Model: This phase is devoted to the computation of those value of decision variables that maximize or minimize the objective function. Such

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

TRANSPOTATION, LIMITS OF TRANSPOTATION PROBLEM

LIMITS OF TRANSPOTATION PROBLEM

PERT, how does it work

how does it work

Explain the method of taylor scientific management, a. Explain the method o...

a. Explain the method of "Taylor's Scientific Management". List the elements of Taylor's Scientific Management. b. List the necessary managerial functions of a Manager. Explain.

Linear regression, regression line drawn as y=c + 1075x, when x was 2, and ...

regression line drawn as y=c + 1075x, when x was 2, and y was 239, given that y intercept was 11. calculate the residual

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

Nass food produce tow kinds of popular dark chocolate bars, Nass food prod...

Nass food produce tow kinds of popular dark chocolate bars

Write Your Message!

Name

Email id

Message

Verfication Code

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!

Submit Assignment

User Account

All Pages