This activity is designed to help you discover how to solve a nonlinear programming problem in which the variables are constrained to be non-negative. We apply Theorem 5.1.1 to these types of problems, as illustrated in the model below. Since most problems in practice require nonnegative variables, this activity will prepare you to deal with real-life problems.
Minimize x2 + y2 - 2xy where x >= 0 and y >= 0.
We first compute grad f(x, y) = (2x - 2y, 2y - 2x).
The conditions for Theorem 5.1.1 as applied to this problem:
Conditions 1 and 2 imply that x = y. This satisfies all the other conditions as long as x ò 0 and y ò 0 Thus all points on the line x = y which are in the first quadrant are stationary points. Checking the Hessian matrix, we get H =
| 2 -2 | |-2 2 |
This matrix is singular, so we must use the definition to check it for definiteness. Since
[h1 h2]H[h1 h2]T = 2(h1 - h2)2 >= 0,
the Hessian is positive semidefinite and hence the function is convex. Thus all stationary points must be relative minima.
These will be provided in class.
f(x1,x2,x3) =
4x12 + x22 +
x32 - 2x1x2 -
2x1x3 - 2x1 + 8
Return to the
List of Activities