PDA

View Full Version : Maximize (nonlinear programming)


hsong9
Sep19-09, 01:38 PM
1. The problem statement, all variables and given/known data
Maximize xy2z3
subject to x3 + y2 + z = 39 and x,y,z > 0


2. Relevant equations



3. The attempt at a solution
I know the answer ( I got this from some site)

x3 + y2 + z = x3 + y2/3 + y2/3 + y2/3 + z/9 + z/9 + z/9 + z/9 + z/9 + z/9 + z/9 + z/9 + z/9 ......
= c(xy2z3)3/13

But I do not know how I can determine a constant multiple of a suitable power of (xy2z3).

Anybody help me