# Linear programming

1. Feb 17, 2008

### Freydulf

1. The problem statement, all variables and given/known data

Solve:

2. Relevant equations

3. The attempt at a solution

Positive-semidefinite, it has a global minimum at (0,0).

Well, that's what I've done til now. I'm not sure whether it's right, can someone give me a hand? :)

2. Feb 18, 2008

Can you explain what you're trying to do? It's hard to help without understanding your approach.

I'm guessing you're trying to show that the function has a positive semi-definite Hessian, which implies convexity, which implies global minimum. However, what you have there is certainly not positive semidefinite.

Do you really believe this? You are essentially saying that both the function $z^3$ and the function $-z^3$ are both non-negative for all z.

Assuming you're trying to look at the Hessian, try differentiating again. It contains SECOND derivatives.

3. Feb 18, 2008

### HallsofIvy

Staff Emeritus
This is certainly NOT "linear programming". Your equations are not linear.