搜索资源列表
jlplq0
- 不等式约束线性规划问题求解（可求解不等式约束条件下的线性规划问题）-inequality constraint solving linear programming problems (can be calculated under the conditions of inequality constraints of linear programming)
liyingnan_3
- 解线性规划，等式约束和不等式约束均有，得到附和约束条件的一组最优解。-linear programming solution, equality and inequality constraints have been echoed by a restrictive conditions Optimal Solutions Group.
quadraticprograming
- 计算不等式约束情况下二次规划问题，操作平台是ＭＡＴＬＡＢ
12LPLQ
- 常用算法程序集(C语言描述)第三版+徐士良 不等式约束线性规划问题
yueshuyouhua_vb
- 复合形法的不等式约束优化。其中的主程序是通用的，只要修改自己的目标函数和约束条件即可。
外点惩罚函数法－调试通过
- 求解n维具有不等式约束优化问题的最优解-solving n-dimensional inequality constrained optimization with the optimal solution
SIMPLEX
- 用C写的求解线性规划问题,即在一组线性不等式或等式组的约束条件下求某个线性函数的最值问题.-using simplex method to solve the linear program
Interior_point_method
- 内点法是从可行域内某一初始内点出发，在可行域内进行迭代的序列极小化方法。它仅用于求解不等式约束优化问题。这里列出内点惩罚函数法的六个子程序。 -Interior point method is a feasible region within the initial point of view, the region, where feasible, to carry out the sequence of iterative minimization method. It is only
linearprog_code
- 这是一个老师布置的作业程序,我是用C++ Builder 4.0写的. 如果学过<线性规划>的话,这个程序要干什么大家都知道,就是求解线性规划问题,即在一组线性不等式或等式组的约束条件下求某个线性函数的最值问题。-Teacher This is a layout of operating procedures, I am using the C++ Builder 4.0 Writing. If the study had <linear programming>, th
CH10
- 10.1 一维极值连分式法jmax1.c 10.2 n维极值连分式法jmaxn.c 10.3 不等式约束线性规划问题jlplq.c 10.4 求n维极值的单形调优法jjsim.c 10.5 求约束条件下n维极值的复形调优法jcplx.c-10.1 One-dimensional extremum continued fractions method jmax1.c 10.2 n-dimensional continued fractions method jmaxn.c 10.3
LMI
- 解决由八个线性矩阵不等式所约束的最小化问题。-Solving the minimiztion problem which is bound to eight linear matrix inequalities .
quadprog_1.5-4
- 二次规划求解程序,包含等式约束，不等式约束，和区间约束-a solver for quardratic programming
l1minqc
- 程序描述了一种内点法的方法，能够实现具有等式不等式约束的线性最优算法求解-Procedure describes a method of interior-point method, to achieve equality with inequality constrained linear optimal algorithm
QP-asm
- 具有等式约束和不等式约束的二次规划问题，的积极集方法（有效集方法）-the active set methods for QP with equality and ineqality constrain
Convex11
- Matlab采用障碍法及原对偶内点法解决不等式约束凸优化问题-barry method, Original dual interior point method
mixfhs
- 混合罚函数法求解非线性方程组，用于最优化处理，约束条件为等式约束和不等式约束相结合-Mixed penalty function method is used to solve the nonlinear equations
example
- 遗传算法实例：生成初始种群：遗传优化算法搜索；将不等式约束作为惩罚项加入适应度函数-Genetic algorithm example
matlab
- 程序为matlab编程的求解约束优化软件，适用于求解等式约束和不等式约束情况；-Matlab program for solving constrained optimization software, suitable for solving equality constraints and inequality constraints
erciguihua
- 用拉格朗日法求解等式约束的凸二次规划 用起作用集法求解不等式约束的凸二次规划 用路径跟踪法求解不等式约束的凸二次规划 -Lagrangian method for solving equality constraints convex quadratic programming work set method for solving inequality constraints convex quadratic programming path tracking method for
增广拉格朗日
- 常用的解决不等式约束优化问题的放法，增广拉格朗日方法等(The commonly used method of solving inequality constrained optimization problems, augmented Lagrange method and so on)