SUMT - Conclusion | Previous | Next |
![]() |
|
When the above unconstrained optimization problem is re-solved, using
the gradient search procedure, with ![]() |
![]() |
![]() |
|
After four iterations of SUMT, we have approached very close to the optimal solution of | |
![]() |
|
This concludes the demonstration. See the OR Tutor menu (to the left) for other demonstrations or close the browser window to exit OR Tutor. |