IGCC空气侧整体综合优化的研究

主要符号表X。。氮气回注系数如空分整体化系数E。；c燃气轮机压气机效率G。l回注氮气流量万燃气轮机透平前温尼。”系统相对效率G。。煤气氮气掺混流量Ea；，c空气专用压缩机效率N。”系统相对功率1前言整体煤气化联合循环（IGCC）系统模拟与优化逐步受到重视，开展了许多相关研究［‘－‘］。但是，现有的方法［‘，‘］一个突出的问题，它是在设定的具体流程方案下的数值分析，这常常导致落入“局部优化掩盖了整体最优”的误区。本文是研究以空分系统为中心的空气侧子系统的整体优化，阐述基本概念，尝试新方法，并结合大型商业化装…     

New Imperfect Conjugate Gradient Algorithm

We present a method which generates conjugate search directions and maintains the quadratic convergence property, when applied to a quadratic function, even when the line searches are not exact. The method is similar to that given by Dixon, but needs one less vector store. When the method is applied to a number of general functions of different dimensionality, results show the efficiency of the method.     

Drawing c-planar biconnected clustered graphs

In a graph, a cluster is a set of vertices, and two clusters are said to be non-intersecting if they are disjoint or one of them is contained in the other. A clustered graph C consists of a graph G and a set of non-intersecting clusters. In this paper, we assume that C has a compound planar drawing and each cluster induces a biconnected subgraph. Then we show that such a clustered graph admits a drawing in the plane such that (i) edges are drawn as straight-line segments with no edge crossing and (ii) the boundary of the biconnected subgraph induced by each cluster is a convex polygon.     

The uv-Decomposition on a Class of D.C. Functions and Optimality Conditions

In this paper,the UV-theory and P-differential calculus are employed to study second-order ex-pansion of a class of D.C.functions and minimization problems.Under certain conditions,some properties ofthe U-Lagrangian,the second-order expansion of this class of functions along some trajectories are formulated.Some first and second order optimality conditions for the class of D.C.optimization problems are given.     

Ant colony optimization: Introduction and recent trends

Ant colony optimization is a technique for optimization that was introduced in the early 1990's. The inspiring source of ant colony optimization is the foraging behavior of real ant colonies. This behavior is exploited in artificial ant colonies for the search of approximate solutions to discrete optimization problems, to continuous optimization problems, and to important problems in telecommunications, such as routing and load balancing. First, we deal with the biological inspiration of ant colony optimization algorithms. We show how this biological inspiration can be transfered into an algorithm for discrete optimization. Then, we outline ant colony optimization in more general terms in the context of discrete optimization, and present some of the nowadays best-performing ant colony optimization variants. After summarizing some important theoretical results, we demonstrate how ant colony optimization can be applied to continuous optimization problems. Finally, we provide examples of an interesting recent research direction: The hybridization with more classical techniques from artificial intelligence and operations research.     

Optimal Investment in a Levy Market

In this paper we consider the optimal investment problem in a market where the stock price process is modeled by a geometric Levy process (taking into account jumps). Except for the geometric Brownian model and the geometric Poissonian model, the resulting models are incomplete and there are many equivalent martingale measures. However, the model can be completed by the so-called power-jump assets. By doing this we allow investment in these new assets and we can try to maximize the expected utility of these portfolios. As particular cases we obtain the optimal portfolios based in stocks and bonds, showing that the new assets are superfluous for certain martingale measures that depend on the utility function we use.     

On the stability of some integer programming algorithms

In the present paper we develop our approach for studying the stability of integer programming problems. We prove that the L-class enumeration method is stable on integer linear programming problems in the case of bounded relaxation sets [9]. The stability of some cutting plane algorithms is discussed.     

The node-edge weighted 2-edge connected subgraph problem: Linear relaxation, facets and separation

Let G=(V,E) be a undirected k-edge connected graph with weights c_e on edges and w_v on nodes. The minimum 2-edge connected subgraph problem, 2ECSP for short, is to find a 2-edge connected subgraph of G, of minimum total weight. The 2ECSP generalizes the well-known Steiner 2-edge connected subgraph problem. In this paper we study the convex hull of the incidence vectors corresponding to feasible solutions of 2ECSP. First, a natural integer programming formulation is given and it is shown that its linear relaxation is not sufficient to describe the polytope associated with 2ECSP even when G is series-parallel. Then, we introduce two families of new valid inequalities and we give sufficient conditions for them to be facet-defining. Later, we concentrate on the separation problem. We find polynomial time algorithms to solve the separation of important subclasses of the introduced inequalities, concluding that the separation of the new inequalities, when G is series-parallel, is polynomially solvable.     

Integration and propagation of a multi-criteria decision making model in constraint programming

In this paper we propose a general integration scheme for a Multi-Criteria Decision Making model of the Multi-Attribute Utility Theory in Constraint Programming. We introduce the Choquet integral as a general aggregation function for multi-criteria optimization problems and define the Choquet global constraint that propagates this function during the Branch-and-Bound search. Finally the benefits of the propagation of the Choquet constraint are evaluated on the examination timetabling problem.     

A Verified Optimization Technique to Locate Chaotic Regions of Hénon Systems

We present a new verified optimization method to find regions for Hénon systems where the conditions of chaotic behaviour hold. The present paper provides a methodology to verify chaos for certain mappings and regions. We discuss first how to check the set theoretical conditions of a respective theorem in a reliable way by computer programs. Then we introduce optimization problems that provide a model to locate chaotic regions. We prove the correctness of the underlying checking algorithms and the optimization model. We have verified an earlier published chaotic region, and we also give new chaotic places located by the new technique.