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

Assignment, operation research scope

operation research scope

Multi stage sampling - sampling decisions, Normal 0 false fal...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Decision analysis models, These models deal with the selection of an opt...

These models deal with the selection of an optimal course of action given the possible pay offs and their associated probability of occurrence. These models are broadly

#title.industry, scope of operation research in insutry and defence

scope of operation research in insutry and defence

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

LPP, USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJE...

USE SIMPLE METHOD TO SOLVE THE FOLLOWING LPP MAXIMISE Z=4X1+10X2 SUBJECT TO CONSTRAINS, 2X1+X2 2X1+5X2 2X1+3X2 X1, X2>0

Scope, With practical example

With practical example

Transportation and linear programming., #what is the similarity and differe...

#what is the similarity and difference between transportation and linear programing models?

On the basis of ratio of change direction, On the Basis of Ratio of Ch...

On the Basis of Ratio of Change Direction a. Linear Correlation: The correlation between two variables a said to be liner if corresponding to a unit change in th

Explain what do you understand by dynamic programming, Question: (a) (i...

Question: (a) (i) Explain what do you understand by ‘Dynamic Programming'. (ii) Describe the dynamic programming approach to solve the shortest route problem. (iii) Outli

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