整数规划

基于GAs求解整数规划问题的算法设计

Algorithm Design Based on Genetic Algorithm for Integer Programming Problem

基于DNA遗传算法的随机整数规划期望值模型求解

The DNA Genetic Algorithm Applied for Solving Stochastic Integer Programming Expected Value Models

基于杂合遗传算法的Portfolio整数规划模型

A Integer Project Model for Portfolio Selection Based on Hybrid Genetic Algorithms

采用本文所设计的求解非线性混合整数规划的一种新方法&连续离散搜索（CDS）算法进行求解，获得了令人满意的结果。

Satisfactory results have been obtained through continuous discrete searching method .

所建立的模型是整数规划，是NP难的。

The model is an integer linear Programming and is NP-hard .

并展望了PSO在混合整数规划领域的研究前景。

Prospect the development orientation of mixed integer programming .

曝光时间和CR摄影得分为目标的0-1整数规划模型，用分组过滤方法简化解空间，最后用遗传算法求解。

Grouped filtering method was used to simplify the solution space , then the optimized model is solved by genetic algorithm .

从模型的形式上看，该模型属于运筹学领域中的非线性0-1整数规划问题，在理论界属于NP-Hard问题，求解起来很困难。

The model is formulated as a non-linear integer-programming problem .

机组组合问题（UC）是高维、非凸、多约束的混合整数规划问题。

Unit Commitment ( UC ) is a high-dimensional , non-convex , multi-constraint mixed integer programming problem .

建立了卫星成像调度问题的0-1整数规划模型，该问题具有NP完全特性。

This paper formulates the satellite imaging scheduling problem as a0-1 integer programming model , which is NP complete .

基于线性整数规划模型的高适应性PMU配置算法

Optimal PMU Placement Algorithm With High Adaptability Based on Linear Integer Planning Model

本问题属于非线性整数规划，也是一个NP-hard问题。

This may be defined as a nonlinear integer programming problem and characterized as an NP-hard problem .

基于求解此类NP难题主要用启发式近似算法，提出了合成分派规则与局部搜索算法相结合的近似算法，用来求解所提出的混合整数规划模型。

Heuristic approximate algorithm is used to solve these NP programs . The composite dispatching rule is combined with local searching to solve the model .

然后利用M个独立的混沌变量在这NM个等分区域中搜索最优解，从而将混沌搜索算法推广应用于解决一类0-1整数规划问题。

Thus , chaotic searching algorithm is generalized to solving a kind of 0-1 integer programming problem . Chaotic searching algorithm is applied to optimize effectiveness in absence of air defenses .

基于状态任务网络（StateTaskNetwork，STN）描述批处理过程，提出了多目的批处理过程的混合整数规划（mixedintegerlinearprogramming，MILP）周期调度数学模型。

This paper presented a mixed integer linear programming ( MILP ) mathematic model for periodic scheduling of multipurpose batch plants based on the representation of State Task Network ( STN ) for process recipes .

首先将汽车装配线简化为一个FlowShop问题，并建立其混合整数规划模型，以求得使各装配工位的准备成本和空闲时间尽可能少并尽可能满足产品需求的粗生产计划。

First of all , an automobile assembly line is simplified into a flow shop , its mixed integer programming model is formulated to obtain a rough production plan by minimizing the overproduction , underproduction , set up and leisure time .

当最大不可控子网中有环时，控制律的求解变成了非线性整数规划（NIP）问题，而NIP问题的求解是非常困难的。

When the maximal uncontrollable subnet is loop-in , the problem is a nonlinear integer program ( NIP ), which is difficult to be solved .

在此基础上，首次建立了描述这一问题的优化模型（0&1整数规划模型），给出了用Tabu搜索技术求解该问题的算法。

A 0-1 integer programming formulation is next established for describing this problem , and a solving algorithm based on the Tabu search ( TS ) technique is then presented .

探讨了生产实际中一维下料的优化问题，建立了下料问题的非线性整数规划的数学模型，并通过LINGO程序获得该优化模型的解。

This paper presents the optimization of one dimensional cutting stock problem and establishs the integer nonlinear programming mathematical model , which is sloved by LINGO program .

此外，收费员排班是一个整数规划问题，而整数规划属于典型的NP难解问题，本文采用了基于遗传规划的整数线性规划问题求解方法来解决收费员排班问题。

In addition , the job scheduling of toll collector is an integer programming problem , and integer programming is a kind of typical NP hard problem which is solved usually by genetic algorithm ( GA ) .

将在线刀具动态调度目标函数看作一整数规划问题，介绍了启发式算法在FMS在线刀具动态调度策略研究中的应用，从而解决了采用解析算法带来的计算耗时问题。

Viewing the target function of tool dispatching as an integer layout problem , introduce the heuristic method into research on tool dispatching strategy in line of FMS , and settle down the time-consume problem brought by analytic method .

接着，本文讨论了在离散系数空间得到FIR滤波器系数最优解的混合整数规划方法：最后采用这一方法设计了最优表示离散系数FIR滤波器，通过FPGA仿真验证这一方法是可行的和高效的。

Then we present a method that uses mixed integer programming to design the FIR filter in a discrete coefficient space ; finally , the implementation of FIR filter in FPGA is discussed , and the result of simulations prove this method is feasible and efficient .

此外，我们提出了线性混合整数规划情况下相应的K-K-T条件。

In addition , we specify the present condition in the case of linear mixed-integer programming by using the corresponding K-K-T condition .

提出了计及机组AGC调节容量变化的数学模型，对利用遗传算法求解这一非线性混合整数规划问题进行了探索。

Under this assumption it is likely that the solution is not the optimal one . A mathematical model which can take the variation of AGC regulating capacity into consideration is proposed . It is suitable to solve this nonlinear mixed integer-programming problem by genetic algorithm .

所有模式均为一整数规划问题，本研究配合CPLEX数学规划软体求解模式。

All decision models are formulated as an integer multiple problem and is solved using a mathematical programming solver .

本文对单约束线性整数规划（ILP，背包问题）的特性进行了分析，通过剪去无效变量对问题进行简化并设计了问题的一种新算法&降维递归算法，全文共分四章。

In this paper , we analyzed some property for the single restrict integer linear programming ( Knapsack problem ), Cut the invalided variable and simplify the problem . Designed a new algorithm & reduce dimension and Recursive algorithm .

根据线性整数规划的分枝定界算法和二次规划的Lemke算法的原理，给出该模型求解的分枝定界算法，并编写了该算法的Matlab程序。

According to the principle of branch and bound algorithm for linear integer programming and the Lemke algorithm for quadratic programming , this thesis shows a branch and bound algorithm and a program of the algorithm with the Matlab programming language for solving the model .

以UCAV的SEAD任务为想定进行仿真，实验结果表明，该混合遗传算法可有效解决大规模整数规划问题，在求解效率和约束满足率上比标准遗传算法有显著提高。

The simulation results under the SEAD scenario show that the hybrid genetic algorithm resolves the UCAV mission assigning effectively , and has better efficiency and higher chromosome satisfying constraints probabilities than the standard genetic algorithm .

对于该优化问题，一般采用遗传算法、模拟退火算法等启发式方法或者整数规划法、Benders解耦法等数学规划方法加以求解。

Generally the optimization problems are solved with help of heuristic methods , such as genetic algorithm ( GA ) and simulated algorithm ( SA ), or mathematical ones containing integer programming algorithm and Benders decomposition method .

MINLP是整数规划的一个重要分支，近几十年来MINLP的应用有了快速的发展，其应用领域包括流程工业、金融、工程、管理科学和运筹学等各个领域。

MINLP which is an important class of Integer Programming ( IP ) has experience tremendous progress in recent years . MINLP have been used in various applications , including process industry , financial , engineering , management science and operations research sectors .