Dynamic programming problems, Operation Research

Maximize z=3x+7y
subject to constraint x+4y<=8 , y<=2
x,y>=0
Posted Date: 10/17/2012 9:15:10 AM | Location : United States







Related Discussions:- Dynamic programming problems, Assignment Help, Ask Question on Dynamic programming problems, Get Answer, Expert's Help, Dynamic programming problems Discussions

Write discussion on Dynamic programming problems
Your posts are moderated
Related Questions

Each day you own 0 or 1 stocks of certain commodity. The price of the stock is a stochastic process that can be modeled as a Markov chain with transition rates as follows

a pipe lis dur for rpair,the repair would cost 10000 and it would last for 3 years.alternatively a new pipe line can be purchase at 30000 for 10 years.assuming 10% depriciation rat

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

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

Solve the following Linear Programming Problem using Simplex method. Maximize Z= 3x1 + 2X2 Subject to the constraints: X1+ X2 = 4 X1 - X2 = 2 X1, X2 = 0


CRITICAL EXAMINATION OF THE APPLICATION OF DECISION THEORY TECHNIQUES OR MODEL IN BUSINESS DECISION MAKING IN NIGERIA

an electric company which generates and distributes electricity conducted a study on the life of poles. tha appropriate life data are given in the following table: years after inst

Exercise Define the terms used in LPP. Mention the advantages of LPP. What are the assumptions and limitations of LPP? A firm produces three pro