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
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 pa


ABC Bank faces a decision to hire two clerks or lease two automatic teller machines. Service rates of clerk 1 and clerk 2 are 41 customers per hour and 36 customers per hour respec

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

Z-Test Prof. Fisher has  given a method  of testing the significance of the correlation coefficient in small  samples. According  to this method the  coefficient of correlation

Information on Research Done Information on Doctoral research work already done  is available from  the followings  sources: a. Bibliography of Doctoral  Dissertations Acce

. 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 pape

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

Method of calculation of Mode Calculation  of Mode  Individual  series: For determining  mode count the  number of times the  various  values  repeat  themselves and the  va

what will happen when line balance doesn not exist