Moreover , comparing with simplex method , this algorithm could n ' t cause vibration phenomenon . in section two , issue involves how to cakulate the constrained nonlinear programming problem by sumt and ag . the method overcomes some limitations such as differentiability , continuity or singlepeak of functions etc . its applying category is more extensive than any other existing methods . especially , it is very efficient for us to cakulate huge constrained nonlinear programming problems 第二部分內容是關于如何利用sumt與ag求解帶約束條件的非線性規劃問題,透過這部分內容,我們將發現,把sumt與ag結合在一起運用到求解帶約束條件的非線性規劃問題可以克服其他一些算法的局限性,譬如,函數的可導性、單峰性等,因而這種方法的應用范圍更廣,尤其在求解大型帶約束條件的非線性規劃問題上效果更為明顯。