A QUASI-SIMPLEX METHOD FOR STRICTLY CONVEX QUADRATIC PROGRAMMING

本文提出一个不用 Kuhn- Tucker条件而直接搜索严格凸二次规划最优目标点的鲁棒方法 .在搜索过程中 ,目标点沿约束多面体边界上的一条折线移动 .这种移动目标点的思想可以被认为是线性规划单纯形法的自然推广 ,在单纯形法中 ,目标点从一个顶点移到另一个顶点。

Processing network models of energy/environment systems

Processing networks are a variant of the standard linear programming network model which are especially useful for optimizing industrial energy/environment systems. Modelling advantages include an intuitive diagrammatic representation and the ability to incorporate all forms of energy and pollutants in a single integrated linear network model. Added advantages include increased speed of solution and algorithms supporting formulation. The paper explores their use in modelling the energy and pollution control systems in large industrial plants. The pollution control options in an ethylene production plant are analyzed as an example. PROFLOW, a computer tool for the formulation, analysis, and solution of processing network models, is introduced.

a constraint solver and its application to path feasibility analysis

Many testing methods are based on program paths. A well-known problem with them is that some paths are infeasible. To decide the feasibility of paths, we may solve a set of constraints. In this paper, we describe constraint-based tools that can be used for this purpose. They accept constraints expressed in a natural form, which may involve variables of different types such as integers, Booleans, reals and fixed-size arrays. The constraint solver is an extension of a Boolean satisfiability checker and it makes use of a linear programming package. The solving algorithm is described, and examples are given to illustrate the use of the tools. For many paths in the testing literature, their feasibility can be decided in a reasonable amount of time.

Optimal design of a 7 T highly homogeneous superconducting magnet for a Penning trap

A Penning trap system called Lanzhou Penning Trap (LPT) is now being developed for precise mass measurements at the Institute of Modern Physics (IMP). One of the key components is a 7 T actively shielded superconducting magnet with a clear warm bore of 156 mm. The required field homogeneity is 3 x 10(-7) over two 1 cubic centimeter volumes lying 220 mm apart along the magnet axis. We introduce a two-step method which combines linear programming and a nonlinear optimization algorithm for designing the multi-section superconducting magnet. This method is fast and flexible for handling arbitrary shaped homogeneous volumes and coils. With the help of this method an optimal design for the LPT superconducting magnet has been obtained.

逆向物流流量不确定闭环供应链鲁棒运作策略设计

考虑一类同时具有再分销、再制造和再利用的闭环供应链在逆向物流流量不确定环境下的运作问题.采用具有已知概率的离散情景描述逆向物流流量的不确定性,利用基于情景分析的鲁棒线性优化方法建立该闭环供应链的多目标运作模型.设计了一个数值算例,其结果验证了运作策略的鲁棒性.在该算例基础上,分析了逆向物流流量的大小对闭环供应链系统运作性能的影响.

聚类引导搜索的移动机器人路径规划方法

本文提出一种聚类引导搜索（cluster guide searching，CGS）的路径规划方法。采用基于最大最小距离的K均值聚类方法对样本进行离线聚类学习，学习结果以相似环境相似决策的知识形式进行存储。路径规划过程中，机器人在线整理环境信息，获得输入空间样本，通过与知识库匹配，检索到最近的类别，然后在该类别内部采用速度优先策略和方向优先策略交替的方式搜索输出空间。若知识不完备导致检索失败，可重启线性规划算法（linear programming，LP）进行在线路径规划，并更新聚类知识库。仿真结果表明该方法是一种有效的路径规划学习方法。

任务分配问题的建模与求解

建立了极大极小任务分配问题的混合整数线性规划模型,提出一种矩阵作业解答,并与穷举解及混合整数线性规划解的计算复杂度进行了比较.理论分析和数值试验表明矩阵作业法对两类任务分配问题,极大极小和总体极小任务分配问题,有效地提供最优解.

多目标追逐问题的一种混合整数线性规划解

研究多车辆多目标追逐的路径规划问题。提出两个基于混合整数线性规划(Mixed integer linear programming,MILP)的多目标追逐(Multi-target pursuit,MTP)模型:就近追逐和"一对一"使能追逐。在两个MIP追逐模型中,小车运动的状态方程考虑为具有线性阻尼的质点动力学方程。采用整数变量描述小车与障碍物的相对位置信息,提出"目标膨胀尺寸"的概念来描述对目标的追逐,定义小车的"追逐方向"。采用选取整变量的等高面法求解MILP追逐问题,并给出初始内点整变量的确定方法。最后给出仿真试验1对两个多目标追逐模型进行对比研究,仿真试验2证实了算法的效率。

加速度空间中基于线性规划的移动机器人路径规划方法

针对动态不确定环境下移动机器人的路径规划问题,提出了加速度空间中一种基于线性规划(Linear programming,LP)的方法.在机器人的加速度空间中利用相对信息,把机器人路径规划这一非线性问题,描述成满足一组线性约束同时使目标函数极小的线性规划问题,嵌入基于线性规划方法的规划器,得到一条满足性能要求的最优路径.仿真试验验证了算法的实用性及有效性,与势场引导进化计算的方法(Artificial potential guided evolution algorithm,APEA)相比更优化,更实时.

柔性制造系统的负荷分配及路径规划方法

柔性是柔性制造系统（ＦＭＳ）的一个基本优点，但这一基本优点却往往被人们所忽视，许多现在运行的ＦＭＳ不是缺乏柔性，就是没能充分利用可获得的柔性来提高生产效率柔性制造系统的负荷分配和路径规划问题正是这种柔性的一个主要方面．然而，路径规划决策却往往被忽视．其中一个主要原因就是人们仍不能从传统的生产管理概念中解放出来．本文在明确概念区分的基础上，提出了一种柔性制造系统的负荷分配和路径规划的线性规划模型，其主要特点是将负荷分配和路径规划问题有机地结合起来，并通过仿真实验验证并分析了此方法对ＦＭＳ性能上的影响。

Optimal bounded control of first-passage failure of strongly non-linear oscillators under combined harmonic and white-noise excitations

A procedure for designing the optimal bounded control of strongly non-linear oscillators under combined harmonic and white-noise excitations for minimizing their first-passage failure is proposed. First, a stochastic averaging method for strongly non-linear oscillators under combined harmonic and white-noise excitations using generalized harmonic functions is introduced. Then, the dynamical programming equations and their boundary and final time conditions for the control problems of maximizing reliability and of maximizing mean first-passage time are formulated from the averaged Ito equations by using the dynamical programming principle. The optimal control law is derived from the dynamical programming equations and control constraint. Finally, the conditional reliability function, the conditional probability density and mean of the first-passage time of the optimally controlled system are obtained from solving the backward Kolmogorov equation and Pontryagin equation. An example is given to illustrate the proposed procedure and the results obtained are verified by using those from digital simulation. (C) 2003 Elsevier Ltd. All rights reserved.