This question almost solves the model of Multi-objectives Mix-integer Nonlinear Programming (MOMINLP).
多目标过程优化综合问题为多目标混合整数非线性规划模型的求解。
We present a general integer nonlinear programming formulation for determining an optimal stationary cyclic schedule of logistics capability.
为了决定最优的稳定周期性的物流运作能力计划，提出了一般性的整数非线性规划公式。
Expressing decision variables of the structure optimization problem in the form of vector, a 0-1 integer nonlinear programming model is presented.
该结构优化问题的决策变量采用了向量表示方法，建立0-1整数非线性规划模型，给出了可行解存在性的判定方法。
Computational results indicate that LCA is a very effective algorithm to solve nonlinear programming problems and mixed-integer nonlinear programming problems.
实例计算结果表明列队竞争算法是求解非凸非线性规划问题和混合整数非线性规划问题的一种非常有效的算法。
Finally, the optimization of system management would be completed through solving nonlinear mixed integer programming.
最后通过解决非线性混合整数规划，完成系统的优化管理。
Be inspired from natural plant growth, this paper proposes a bionic algorithm for solving the global optimization of nonlinear integer programming.
从大自然植物生长中得到启发，提出了一种求解非线性整数规划全局最小解的仿生算法。
The interrelation between the stations is included by the model which is a nonlinear integer programming with logical expression.
模型中考虑了电厂间相互关联，从而得到含有逻辑表达式的非线性整数规划模型。
This paper proposes an efficient new algorithm by construction of a direct discrete search direction for a class of nonlinear integer programming problems.
针对一类非线性整数规划问题，通过构造直接离散搜索方向提出了一种十分有效的新算法。
With all kinds of operation constraints, fast restoration of supply under battle damage is a typical nonlinear integer programming problem.
在满足各种运行约束条件下，快速地恢复因战斗受损的负荷供电是一典型的非线性整数规划问题。
Mathematical models that use linear, nonlinear, dynamic, integer, or multi-objective programming algorithms.
数学模型，如利用线性、非线性、动态、整数或多目标编程算法。
When the maximal uncontrollable subnet is loop-in, the problem is a nonlinear integer program (NIP), which is difficult to be solved.
当最大不可控子网中有环时，控制律的求解变成了非线性整数规划(NIP)问题，而NIP问题的求解是非常困难的。
The problem of bounded nonlinear mixed integer programming is studied.
对一有界约束非线性混合整数规划问题进行了研究。
In this article, the methods for solution of a nonlinear mixed integer Programming is discussed.
本文讨论一类非线性混合整规划问题的解法。
This paper discusses how to solve the nonlinear two-level decision making problem with integer variables.
本文讨论一类含整变量的非线性两层决策问题。
The Contraction expansion algorithm was improved by greatly reducing visiting objective function, so it could solve the large scale, integer and combined constrained nonlinear programming.
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
Otherwise, the problem is called a nonlinear integer program.
否则，就称之为非线性整数规划问题。
Combining these results, the theory of the nonlinear resonance of a class of half-integer degree of freedom, which was established before by the author, can be applied to the movable power systems.
将这些结果综合起来，就表明作者以前所建立的一类半整数自由度级的非线性共振的理论是可以用于移动电站的。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
为设计求解该问题的分支定界算法，建立了非线性整数规划模型。
Distribution network planning is a nonlinear mixed integer program problem which is usually difficult to be solved by conventional optimization algorithm.
配电网络规划属于非线性混合整数规划问题，应用传统数学优化算法往往难以直接求解。
This model is nonlinear mixed integer programming and can be solved with neural network method and the chart of computer calculation process is also given.
该模型属非线性混合整数规划问题，采用神经网络方法求解，并给出了计算机软件算法框图。
It can be summed up as a typical large-scale nonlinear mixed-integer programming problem.
该问题可以归纳为一个典型的大规模非线性混合整数规划问题。
A new ACO algorithm for unconstrained nonlinear integer optimization problem is present.
提出了一种新的蚁群算法来求解无约束的整数规划问题。
This paper presents an integrated mixed-integer/nonlinear dynamic reactive-power optimization model and algorithm for power distribution network.
提出了一种完整的配电网络非线性混合整数动态无功优化模型及数学优化算法。
In this paper, a sort of nonlinear bilevel mixed integer-programming problem is discussed.
本文讨论的主要内容是双层规划中的混合整数双层线性规划。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
应用推荐