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

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

Linear problem, A paper mill produces two grades of paper viz., X and Y. Be...

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

Inventory Control Model, 1. A local university purchases exercise books to ...

1. A local university purchases exercise books to give to their students. Instead of a fixed unit cost, their supplier quotes the following discount pricing: Order quantity Unit P

U.S. Healthcare Timeline, 500 word summary written in third person on predi...

500 word summary written in third person on predictions of how current healthcare reform polocies will impact the future of healthcare

Sequencing problem, impact of sequencing problem

impact of sequencing problem

Simo chart flow diagram , SIMO Chart Flow Diagram The flow diagram ...

SIMO Chart Flow Diagram The flow diagram is a drawing indicating the paths of men materials or components on a scale plan of the work area, department or factory.

Operations research, six operators are to be assigned to the 5 jobs with th...

six operators are to be assigned to the 5 jobs with the cost of assignments

Assignment, Q2.Six Operators are to be assigned to five jobs with the cost ...

Q2.Six Operators are to be assigned to five jobs with the cost of assignment in Rs. given in the matrix below. Determine the optimal assignment. Which operator will have no assignm

LPP using Simple method, Maximize Z= 3x1 + 2X2 Subject to the constraints: ...

Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0

OR, Models in OR

Models in OR

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