When the maximal uncontrollable subnet is loop-in, the problem is a nonlinear integer program ( nip ), which is difficult to be solved 当最大不可控子网中有环时,控制律的求解变成了非线性整数规划(nip)问题,而nip问题的求解是非常困难的。
Each student should identify a potential or actual linear, non-linear or integer programming application based on their prior work experience, or from some other personal experience 每一位同学都应该根据你在以前积累的工作经验或其他个人经验来确定一个潜在的或真实的线性、非线性或整数规划的应用。
Some research work for integer programming has been done by now, but less for integer nonlinear programming, and little has been done to it by initiatory method 对纯整数非线性规划问题目前已有一些工作,对非线性混合整数规划问题的工作较少,用启发式算法解决混合整数非线性规划问题的工作也不多见。
Secondly, for the petri nets controller synthesis of des, linear integer program ( lip ) is an efficient technique for the on-line computation of the control policy when the maximal uncontrollable subnet is loop-free 当最大不可控子网是无环结构时,线性整数规划(lip)是一种非常有效的在线求解控制律的方法。
Methods such as branch and bound algorithm, mixed integer programming, transportation model and separable linear programming method have been used in recently years . others are heuristic methods like genetic algorithm 近年来求解选址模型用得较多的数学优化方法有分支定界法、混合整数规划法、运输模型法、可分离线性规划法。
It improves on preventing the switching control process from oscillation and refusing compensation . the other is optimal switching control of the multi-tap capacitors formulated by nonlinear hybrid integer programming model 为了实现全局优化控制,本文将一个非线性混合整数规划优化控制模型逐次线性化成增量形式后求解,即逐次线性规划法。
The paper discussed a method combining integer programming based on similarity coefficient with quadratic programming considering ratio of capacity to loading in workshop to obtain parts families and machines groups in two steps 摘要采用了基于相似系数的整数规划和考虑车间资源负荷分配比率的二次规划相结合的方法,分两步得到了零件族和设备组。
The topics covered in this course include : unconstrained optimization methods, constrained optimization methods, convex analysis, lagrangian relaxation, nondifferentiable optimization, and applications in integer programming 这门课程的主题包括:无限制最适化方法,限制最适化方法,凸分析,拉格朗日松弛法,不可微分函数最适化,以及在整数规划上的应用。
Many problems of engineering and system are integer or mixed integer programming problems . lt is well known that the problem of integer programming is a np-hard problem, and the method for it is exponential complex 工程、系统问题中有许多问题属于整数或混合整数规划问题。众所周知,线性整数规划问题是np-hard问题,求解该问题的精确解算法具有指数复杂性。
Many problems of engineering and system are integer or mixed integer programming problems . lt is well known that the problem of integer programming is a np-hard problem, and the method for it is exponential complex 工程、系统问题中有许多问题属于整数或混合整数规划问题。众所周知,线性整数规划问题是np-hard问题,求解该问题的精确解算法具有指数复杂性。