New reformulations for probabilistically constrained quadratic programs

The mixed integer quadratic programming (MIQP) reformulation by Zheng, Sun, Li, and Cui (2012) for probabilistically constrained quadratic programs (PCQP) recently published in EJOR significantly dominates the standard MIQP formulation ( and ) which has been widely adopted in the literature. Stimulated by the dimensionality problem which Zheng et al. (2012) acknowledge themselves for their reformulations, we study further the characteristics of PCQP and develop new MIQP reformulations for PCQP with fewer variables and constraints. The results from numerical tests demonstrate that our reformulations clearly outperform the state-of-the-art MIQP in Zheng et al. (2012).     

Stability in the presence of degeneracy and error estimation

Received February 10, 1997 / Revised version received June 6, 1998 Published online October 9, 1998     

A parametric view on the Mangasarian–Fromovitz constraint qualification

The growth of the multipliers, when the parameter approaches such a critical parameter, is characterized by a parametric constraint qualification which is introduced here. It is equivalent to a bound on the growth of the multipliers. Received May 8, 1995 / Revised version received February 12, 1998 Published online February 25, 1999     

基于最小化收发器数量的光网络业务量疏导

研究了网格型波分复用中的业务量疏导问题,首先把该问题表示为整数线性规划问题(ILP),优化的目标是使得网络中使用的收发器数量最少由于问题的计算复杂度较高,提出了一种启发式算法来解决该问题,数值结果表明:这种算法可以得到与整数线性规划(ILP)得到的最优解相近的结果,在WDM网络中采用适当的业务量疏导可以减少网络中使用的收发器数量。     

A Dual Approach for Solving Nonlinear Infinity-Norm Minimization Problems with Applications in Separable Cases

In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinity- norm minimization problems.Numerical results are presented.     

Recursive intermediate factorization and complete computational linearization of the coupled-cluster single,double, triple,and quadruple excitation equations

Summary The nonlinear CCSDTQ equations are written in a fully linearized form, via the introduction of computationally convenient intermediates. An efficient formulation of the coupled cluster method is proposed. Due to a recursive method for the calculation of intermediates, all computational steps involve the multiplication of an intermediate with aT vertex. This property makes it possible to express the CC equations exclusively in terms of matrix products which can be directly transformed into a highly vectorized program.This work has been supported by the U.S. Air Force Office of Scientific Research, Grant No. 90-0079     

The small octagon with longest perimeter

The convex octagon with unit diameter and maximum perimeter is determined. This answers an open question dating from 1922. The proof uses geometric reasoning and an interval arithmetic based global optimization algorithm to solve a series of non-linear and non-convex programs involving trigonometric functions.     

用集成电路制作简谐振动参考圆与振动曲线示教板控制器

用集成电路制成程序控制器，示教板性能稳定，寿命长，效果好，操作方便．其主要部分由电源、时钟、逻辑电路、输出驱动器四部分组成．     

A Duality Theory for a Class of Generalized Fractional Programs

In generalized fractional programming, one seeks to minimize the maximum of a finite number of ratios. Such programs are, in general, nonconvex and consequently are difficult to solve. Here, we consider a particular case in which the ratio is the quotient of a quadratic form and a positive concave function. The dual of such a problem is constructed and a numerical example is given.     

The linear complementarity problem as a separable bilinear program

The nonmonotone linear complementarity problem (LCP) is formulated as a bilinear program with separable constraints and an objective function that minimizes a natural error residual for the LCP. A linear-programming-based algorithm applied to the bilinear program terminates in a finite number of steps at a solution or stationary point of the problem. The bilinear algorithm solved 80 consecutive cases of the LCP formulation of the knapsack feasibility problem ranging in size between 10 and 3000, with almost constant average number of major iterations equal to four.This material is based on research supported by Air Force Office of Scientific Research Grant F49620-94-1-0036 and National Science Foundation Grants CCR-9322479 and CDA-9024618.