Formulate this as a 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:- Formulate this as a Linear Programming Problem.

Secondary periodicals - classification of documents, Secondary Periodicals:...

Secondary Periodicals: Secondary Periodicals Secondary periodicals are  abstracting and indexing periodicals.  They are also called documentation periodicals. They are a  syst

process technolgy, 1 strategic implication of product and process decision...

1 strategic implication of product and process decisions 2 process planning and design 3 work measurement

Operations research, What are artificial variable why do you need them

What are artificial variable why do you need them

TRANSPORATION PROBLEM, sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2...

sOLVE THE FOLLOWING D1 D2 D3 SUPPLY s1 2 2 3 10 s2 4 1 2 15 s3 1 3 1 40 Demand 20 15 30

one tailed test diagrams - hypothesis testing, Normal 0 false ...

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

Operations Decision, 2.Assess the current environmental scan factors that a...

2.Assess the current environmental scan factors that are relevant to the decision making process. Determine the factors that will have the greatest impact on plant operations and m

PERT, how does it work

how does it work

Linear Equation, Cohen Chemicals, produces two types of photo-developing fl...

Cohen Chemicals, produces two types of photo-developing fluids. The first, a black and white picture chemical, costs Cohen $2500 per ton to produce. The second, a colour photo chem

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

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!

Captcha
Free Assignment Quote

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd