对一有界约束非线性混合整数规划问题进行了研究。
The problem of bounded nonlinear mixed integer programming is studied.
该问题可以归纳为一个典型的大规模非线性混合整数规划问题。
It can be summed up as a typical large-scale nonlinear mixed-integer programming problem.
配电网络规划属于非线性混合整数规划问题，应用传统数学优化算法往往难以直接求解。
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.
建立了基于浇次计划的炉次计划模型，经过变换，将混合整数规划问题转化为线性规划迭代求解问题。
A model of furnace plan based on casting plan was established, which was converted from mixed integral program problem to linear program problem.
GLPK是一个求解大规模的线性规划问题(LP)、混合整数规划问题(mip)以及相关问题的自由软件包。
GLPK is a package intended for solving large-scale linear programming (LP), mixed integer linear programming (MIP) problems.
给出了问题的数学描述，并对其静态问题，构造了一个混合整数规划模型。
A mixed integer programming formulation for the off-line version of the problem has been proposed.
建立了热轧无缝钢管主生产计划问题的混合整数线性规划模型。
The master production scheduling(MPS) problem of hot rolling seamless steel tube is formulated as a mixed integer linear programming model.
为解决实际生产中一种无调整费用的生产计划问题，给出了一个双目标混合整数规划模型。
A model of double objective mixed integral programming for settling production planning problems without the cost of adjustment was established.
我们将说明传统的混合整数规划方法使问题难以描述和解决。
We will show that the traditional mixed integer programming approach makes the problem difficult to represent and solve.
本文给出了用代理约束选取混合整数线性规划问题初始可行解的一种方法。
In this paper, a method using surrogate constraint to select an initial feasible solution of a mixed integer linear programming problem is presented.
模型表达为一个混合整数规划(MIL P)问题。
The model is formulated as a mixed integer linear programming (MILP) problem.
本文首先深入分析多无人机任务分配问题的特点，建立了扩展的混合整数线性规划(MILP)任务分配模型。
Firstly, the features of UAV task assignment are analyzed in depth, and then the extended mixed integer linear programming (MILP) model for task assignment is established.
建立了兵力展开问题的数学模型，此模型是一个混合整数规划模型。
This paper sets up a mathematic model for the manpower deployment, which is a mixed integer programming model.
建立了连锁门店选址和配送中心选择联合决策问题的模糊多目标混合整数规划模型。
The joint decision-making problem for chain store location and distribution center selection is formulated as a fuzzy multi-objective mixed-integer programming model.
该模型为混合0 - 1整数规划模型，属于NP问题，直接求解较困难。
The model belongs to mixed 0-1 integer programming model and is NP problem, the more difficult to solve directly.
根据混合逻辑动态系统的标准形式，转化为混合整数二次规划(MIQP)的问题，同时获得它的数学描述。
According to the standard form of MID system, the problem of mixed integer quadratic programming (MIQP) and its mathematics description can be obtained.
提出了求解具有水、火电厂和抽水蓄能电厂的多区域电网日经济调度问题的基于混合整数规划的新算法。
To perform the daily dispatch of multi regional power network with hydro plants, thermal plants and pump storage plants, a new algorithm based on mixed integer planning is presented.
多目标过程优化综合问题为多目标混合整数非线性规划模型的求解。
This question almost solves the model of Multi-objectives Mix-integer Nonlinear Programming (MOMINLP).
电网规划是一个混合整数非线性规划问题，控制变量多、复杂程度高。
It is the typical mixed and integral non-linear planning problem that there are many control variables and the complexity is high.
针对编队卫星队形重构的轨迹规划问题，提出了直接配置混合整数线性规划(DCMILP)方法。
This article presents a direct collocation mixed integer linear programming (DCMILP) method for energy-optimal trajectory planning of satellite formation reconfiguration.
汽轮机系统和锅炉系统分别构成线性混合0 - 1整数规划问题和非线性规划问题。
The steam turbine system and the boiler system construct respectively an integral linear 0-1 problem and a non-linear problem.
为了解决印刷电路板化学处理的排序问题，给出了一个新的单抓钩周期排序的混合整数规划模型，并针对该模型提出了结合线性规划模型的启发式算法。
A new mixed integer linear programming (MILP) model for the single hoist cyclic scheduling is developed, and based on this MILP model, a heuristic method together with linear programming is proposed.
实例计算结果表明列队竞争算法是求解非凸非线性规划问题和混合整数非线性规划问题的一种非常有效的算法。
Computational results indicate that LCA is a very effective algorithm to solve nonlinear programming problems and mixed-integer nonlinear programming problems.
这篇文章通过建立一个基于供应链网络的混合整数规划模型，解决了产品导入中，合理地配置供应链的问题。
In this paper, we set up a mixed-integer programming model to configure the supply chain network successfully over the lifecycle of the product.
分支定界法可求纯整数或混合整数线性规划问题，求解方法由分支和定界组成。
To develop a branch and bound method for this problem, a nonlinear integer-programming model was constructed.
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
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.
将缩张算法加以改进，较大程度地减少目标函数的访问次数，既可运用到规模和难度较大的约束非线性规划问题，也可运用到整数及混合规划问题。
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.
应用推荐