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

Lcm, one example

one example

Chi square test for independence of attribute , Chi Square Test for Indepe...

Chi Square Test for Independence of Attribute The chi square test can be used to find out whether two or more attributes are associated or not. This test helps in fin

Operations research as a decision-making sci, Short Define operations resea...

Short Define operations research as a decision-making science

Simple method, solve the LPP using simple method, maximize z= 3x1+2x2 subje...

solve the LPP using simple method, maximize z= 3x1+2x2 subject to constraints

Big M method, Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Maximize p = (3)x + 2y subject to 2x + y 3x + 4y >= 12

Characteristics of good average, Characteristics of Good Average a. ...

Characteristics of Good Average a. It should be Rigidly Defined An average should be rigidly defined so that there is no confusion in regard to its meaning and con

Inherent limitation concerning mathematical expressions, Operation reac Inv...

Operation reac Involves the use of mathematical models, equations and similar other mathematical expressions. Assumptions are always incorporated in the derivation of an equa

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

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

Linear programming, Solve the following Linear Programming Problem using Si...

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

North west corner method, what are the limitations of north west corner met...

what are the limitations of north west corner method

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