不等式约束优化问题的一个势函数

基于Carroll(1961)建立的罚函数，本文给出了不等式约束优化问题的一个势函数，并且讨论了该函数的性质．最后证明了在此基础上建立的对偶算法具有Q-线性收敛性．     

基于模糊方法的多人合作对策的研究

多人合作对策模型中联盟的收入和总体的收入常常出现相互矛盾的情况 ,此时核是空集 .由于不存在核 ,无法用 Nash-Harsanyi谈判模型求解 .采用模糊数学方法 ,调整模型中线性约束的右端系数 ,使核在一定程度上是非空集合 ,得到模糊意义下的 Nash平衡解 .该方法一定程度上解决了各联盟收入与总体收入的矛盾 .最后通过一个算例说明该方法的可行性 .     

Some properties of the bilevel programming problem

The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board.     

平衡规划问题的熵函数方法及其在混合交通流中的应用

将参变极值问题的极大熵函数方法应用到求解平衡规划问题中,通过先验分布信息和Kullback熵概念,给出了平衡规划问题基于Kullback熵表示的熵函数求解方法,并将平衡规划的极大熵函数方法应用于求解混合交通平衡分配问题．     

一种求解混合多目标规划问题的功效函数法

逻辑生长函数相对于龚珀兹生长函数具有拐点高和对称性的特点,采用逻辑生长函数形式的功效函数法求解混合多目标规划问题具有形式简单、计算量小、符合实际的优点。证明了用这种方法求出的最优解是有效解。讨论了满意值对有效解的影响。逻辑生长函数还可以应用于多维变量评价的功效系数法中。     

Survivable network design under optimal and heuristic interdiction scenarios

We examine the problem of building or fortifying a network to defend against enemy attacks in various scenarios. In particular, we examine the case in which an enemy can destroy any portion of any arc that a designer constructs on the network, subject to some interdiction budget. This problem takes the form of a three-level, two-player game, in which the designer acts first to construct a network and transmit an initial set of flows through the network. The enemy acts next to destroy a set of constructed arcs in the designer’s network, and the designer acts last to transmit a final set of flows in the network. Most studies of this nature assume that the enemy will act optimally; however, in real-world scenarios one cannot necessarily assume rationality on the part of the enemy. Hence, we prescribe optimal network design algorithms for three different profiles of enemy action: an enemy destroying arcs based on capacities, based on initial flows, or acting optimally to minimize our maximum profits obtained from transmitting flows.     

Optimality and duality in multiobjective fractional programming involving ρ-semilocally type I-preinvex and related functions

Optimality conditions are obtained for a nonlinear fractional multiobjective programming problem involving η-semidifferentiable functions. Also, a general dual is formulated and a duality result is proved using concepts of generalized ρ-semilocally type I-preinvex functions.     

L p -dual Quermassintegral sums

In this paper, we first introduce a concept of L _p -dual Quermassintegral sum function of convex bodies and establish the polar projection Minkowski inequality and the polar projection Aleksandrov-Fenchel inequality for L _p -dual Quermassintegral sums. Moreover, by using Lutwak’s width-integral of index i, we establish the L _p -Brunn-Minkowski inequality for the polar mixed projection bodies. As applications, we prove some interrelated results. This work was partially supported by the National Natural Science Foundation of China (Grant No. 10271071), Zhejiang Provincial Natural Science Foundation of China (Grant No. Y605065) and Foundation of the Education Department of Zhejiang Province of China (Grant No. 20050392)     

Solving large-scale semidefinite programs in parallel

We describe an approach to the parallel and distributed solution of large-scale, block structured semidefinite programs using the spectral bundle method. Various elements of this approach (such as data distribution, an implicitly restarted Lanczos method tailored to handle block diagonal structure, a mixed polyhedral-semidefinite subdifferential model, and other aspects related to parallelism) are combined in an implementation called LAMBDA, which delivers faster solution times than previously possible, and acceptable parallel scalability on sufficiently large problems. This work was supported in part by NSF grants DMS-0215373 and DMS-0238008.