本程序实现运筹学--非线形规划中的单纯形法,求fmin(X)=4*(X1-5)*(X1-5)+(X2-6)(X2-6)的具有最小值时的最优解,如需改变所求函数,在子函数f中修改即可-the program tacticians -- non-linear planning for the simplex method, seeking fmin (X) = 4 * (X1 - 5) * (X1 - 5) (X2-6) (X2-6) with the minimum of the optimal