针对非线性约束问题，提出了一种新的、可行的混沌优化算法。
A new, feasible chaos optimization algorithm is presented to nonlinear constrained programming problem.
特种变压器电磁参数的优化设计是一个带有等式和不等式约束，满足某种设计目标的非线性规划问题。
Optimization mathematical model of special transformer electromagnetism parameters is a nonlinear programming problem with equality and inequality constraints, to meet some certain design objective.
配电网重构是一个多目标、 多约束、离散的非线性组合优化问题。
Distribution network reconfiguration is a multi - objective , multi - constraint, discrete nonlinear combinatory optimization problem.
本文对线性约束不可分离凸背包问题给出了一种精确算法。
In this paper, we present an exact algorithm for solving nonseparable convex knapsack problems with linear constraints and bounded integer variables.
无约束优化问题的共轭梯度路径构造的思想启迪我们用其来解带线性等式约束和有界变量约束的优化问题。
The idea of conjugate gradient path in unconstrained optimization irradiates us to use this method for solving the linear equality optimization subject to bounds on variables.
本文就质点系平衡问题进行了一般性的推证，给出了当约束是理想、线性定常约束时的质点系平衡的充要条件。
The general inference and demonstration of the equilibrium problem of particle system are carried on, the full and necessary conditions are given while the constraint is ideal, linear and scleronomic.
提出了一类解极小极大问题的熵函数法，这种方法也可用来解线性或约束优化问题。
A method for solving minimax problem is presented, which also can be used to solve linear or constrained optimization problems.
本文改进了带线性约束0 - 1二次规划问题的罚参数下界。
In this paper, penalty parameter for linearly constrained 0-1 quadratic programming is improved.
第3章给出了广义模式搜索算法对线性等式约束最优化问题的一个新解法，并证明了这种算法的全局收敛性。
Chapter 3 constructs a new generalized pattern search method for linear equality constrained optimization problems and gives the proofs of the global convergence.
提出了一种基于梯度投影矩阵下的求解线性约束下规划问题的神经网络。
A novel neural network is proposed, which solve the programming problems with linear restraints based on gradient projecting matrix.
对一类带有非负边界约束的线性不等式约束优化问题进行了研究，提出了一种新的信赖域算法。
We propose a new trust region algorithm for special linear inequality constrained optimization problems with nonnegative bound constraints.
本文提出了一个解不等式约束非线性规划问题的有效方法。
A new efficient method for solving nonlinear programming problem is studied in this paper.
通过变换可将该无约束优化问题转化为求解非线性代数方程组的问题。
This unconstrained optimization problem may be transformed into nonlinear algebraic system of equations.
求线性约束凸规划问题的最优解。
Objective: To search optimal solutions of convex programming problems with linear constraints.
用序列无约束极小化方法（SUMT）求解非线性有约束的优化问题。
The non linear optimization problem with constraint has been solved by use of the sequential unconstrained minimization technique (SUMT).
在本文中，我们考虑非线性不等式约束优化问题。
In this paper, we consider the nonlinear inequality constrained optimization problems.
该模型所描述的均衡问题是一个具有均衡约束的均衡问题(EPEC)，可用非线性互补方法求解。
This model can be formulated as an equilibrium problem with equilibrium constraints (EPEC) and be solved by a nonlinear complementarity method.
研究了线性约束的非线性凸规划问题，基于最优性的充要条件，提出了求解它的一个神经网络。
The paper studies the nonlinear programming problem with linear constraints. Based on its optimality conditions, a neural network for solving it is proposed.
平面选址问题实质上是带约束的非线性连续函数优化问题。
The essential of planar location issue is nonlinear continuous function optimization under constrained condition.
研究了一类非线性互补约束的均衡问题。
A kind of nonlinear complementarity constraints with equilibrium problems is studied.
并将此模型巧妙地转化成了约束非线性规划问题，可采用多种优化方法求解。
It is transformed ingeniously into a non-linear programming problem with constraints which can be solved by many optimal methods.
本文提出了一个解线性等式约束优化问题的新锥模型信赖域方法。
In this paper, a trust region method with new conic model for linearly constrained optimization problems is proposed.
计算机网络优化是一个多约束条件的非线性0— 1问题。
Optimization of computer networks is a multi-restrain condition nonlinear 0-1 problem.
基于混沌神经网络模型可以有效地解决高维、离散、非凸的非线性约束优化问题。
The Chaotic neural network model can be used to solve many multi-dimensioned, discrete, non-convex, nonlinear constrained optimization problems.
本文研究含有线性等式约束的非线性规划问题的降维算法。
In this paper, the descending dimension algorithm for nonlinear programming problems with linear equality constraints are discussed.
约束复合形法是求解约束非线性最优问题的一种重要方法。
The constrained complex method is one of the important ways to resolve the problem of nonlinear optimization.
利用阶梯折算法，问题可以化为一个具有等式约束的标准的非线性规划问题。
The problem can be posed as a standard nonlinear programming problem with equality constraints by means of the stepped reduction method.
目前对有约束非线性规划问题还没有通用的求全局最优解的算法。
Currently, there is no general algorithm to find the global optimal solution for the constrained non-linear programming problems.
目前对有约束非线性规划问题还没有通用的求全局最优解的算法。
Currently, there is no general algorithm to find the global optimal solution for the constrained non-linear programming problems.
应用推荐