基本遗传算法带最优保存思想的背包问题，其中，目标值那段代码使用的是惩罚函数法，选择是概率选择，交叉是双点随机交叉，变异是概率变异-The basic genetic algorithm with elitist thinking knapsack problem, which is a target that part of the code using penalty function method, choice is the probability of selection, crosso

最优化方法，作业，包括BFGS，SUMT惩罚函数法等-Optimization

本matlab程序用惩罚函数法求解多元模型的最小值（给出初始点和精度要求条件）。-The matlab program for solving the minimum multivariate model with penalty function method (given initial point and precision conditions).

最优化实验外惩罚函数法，我们根据约束的特点，构造某种惩罚函数，然后加到目标函数中去，将约束问题求解转化为一系列的无约束问题。这种“惩罚策略”，对于无约束问题求解过程中的那些企图违反约束条件的目标点给予惩罚。(According to the characteristics of constraints, we construct some penalty function, and then add it to the objective function to transform the co

Matlab编写的内点惩罚法，内附有函数说明，简单实用(The interior point punishment method compiled by Matlab is simple and practical with function explanation)