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

Sequencing problem, What is the optimum solution

What is the optimum solution

Linear programming, #questiona paper mill produce two grades of x&y.becouse...

#questiona paper mill produce two grades of x&y.becouse of raw material reswtriction

REGRESSION, regression line drawn as Y=C+1075x, when x was 2, and y was 239...

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

Scope and concept, Explian scope and concept of Operations research?

Explian scope and concept of Operations research?

Advantages of mode - measure of central tendency, Advantages of Mode ...

Advantages of Mode a.It is easy to understand as well as easy to calculate. In can be found out by inspection. b.It is usually an exacta value as it occurs most fre

Dual of the lpp, the dual form of the following lpp min z=3x1+2.5x2 constra...

the dual form of the following lpp min z=3x1+2.5x2 constraints:2x1+4x2>=40, 3x1+2x2>=50 and x1,x2>=0

BIG M, minimization

minimization

Determine the required factors of production in a company, 1) Provide a de...

1) Provide a description of the required factors of production, grouping them according to whether the factors of production are a) Fixed and hence unlikely to vary much accord

Short question, write down any two assumption of L.P

write down any two assumption of L.P

Linear programing, Solve the following Linear Programming Problem using Sim...

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

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