Balance constraints reduction of large-scale linear programming problems

This paper describes a method and the corresponding algorithms for simplification of large-scale linear programming models. It consists of the elimination of the balance constraints (i.e. constraints with zero RHS term). The idea is to apply some linear transformations to the original problem in order to nullify the balance constraints. These transformations are able to simultaneously eliminate more balance rows. The core of this contribution is the introduction of the reduction matrix and the associated theorems on the equivalent linear programs (original and reduced). The numerical experiments with this method of simplification proved this approach to be beneficial for a large class of LP problems.This research work was done while the first author was at Duisburg University, Mess-, Steuer und Regelungstechnik, Germany, under the greatly appreciated financial assistance given by the Alexander-von-Humboldt Foundation.     

NCO自由基与SO_2、CS_2反应的速率常数

利用波长为266nm的激光光解CHBr3产生CH自由基,其与NO反应作为NCO自由基的来源.在298K,总压2660Pa的条件下,采用激光诱导荧光的方法,研究了NCO自由基与SO2、CS2的反应.得到了NCO自由基与SO2、CS2双分子反应速率常数分别为(1.8±0.3)×10-11和(3.1±0.4)×10-12cm3·molecule-1·s-1.对这两个反应在B3LYP/6-31 G(d)的水平上进行理论研究的结果表明,NCO自由基与SO2、CS2的反应是加成反应,其机理是NCO自由基中的N原子攻击反应物的中心原子,得到加成产物.     

Beam quality factor of mixed modes emerging from a multimode step-index fiber

The beam quality factors (or M² parameter) of coherent and incoherent superposition of the several lower-order LP modes emerging from a step-index fiber have been calculated by using the second-order moment method. The results indicate that, for an individual LP mode, the M² parameter takes its maximum value when the normalized frequency V of the step-index fiber approaches the cut-off frequency, and it gradually becomes constant as V increases. In the case of incoherent superposition, the larger the fraction intensity carried by the higher-order mode, the larger the beam quality factor M². Under certain circumstances, the value of the M² parameter of the mixed mode that comprises several LP-modes contents may become even smaller and closer to the ideal Gaussian beam than that of the fundamental mode in a step-index fiber. However, in the case of the coherent superposition, the value of the M² parameter of the mixed mode may be greater than that of the higher-order constituent mode. The results reported here could be helpful for the application of the high-power fiber laser systems.     

Uniform LP duality for semidefinite and semi-infinite programming

Recently, a semidefinite and semi-infinite linear programming problem (SDSIP), its dual (DSDSIP), and uniform LP duality between (SDSIP) and (DSDSIP) were proposed and studied by Li et al. (Optimization 52:507–528, 2003). In this paper, we show that (SDSIP) is an ordinary linear semi-infinite program and, therefore, all the existing results regarding duality and uniform LP duality for linear semi-infinite programs can be applied to (SDSIP). By this approach, the main results of Li et al. (Optimization 52:507–528, 2003) can be obtained easily.     

Fuzzy Multi-fractional Programming for Land Use Planning in Agricultural Production System

In this paper, we present a multi-objective linear fractional programming (MOLFP) approach for multi-objective linear fuzzy goal programming (MOLFGP) problem. Here, we consider a problem in which a set of pair of goals are optimized in ratio rather than optimizing them individually. In particular, we consider the optimization of profit to cash expenditure and crop production in various seasons to land utilization as a fractional objectives and used remaining goals in its original form. Further, the goals set in agricultural production planning are conflicting in nature; thus we use the concept of conflict and nonconflict between goals for computation of appropriate aspiration level. The method is illustrated on a problem of agricultural production system for comparison with Biswas and Pal [1] method to show its suitability.     

Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems

As computing resources continue to improve, global solutions for larger size quadrically constrained optimization problems become more achievable. In this paper, we focus on larger size problems and get accurate bounds for optimal values of such problems with the successive use of SDP relaxations on a parallel computing system called Ninf (Network-based Information Library for high performance computing).     

George B. Dantzig and systems optimization

We pay homage to George B. Dantzig by describing a less well-known part of his legacy–his early and dedicated championship of the importance of systems optimization in solving complex real-world problems.     

0–1 equivalent model representations for air traffic management

We present two equivalent representations of a 0–1 model for the Air Traffic Flow Management Problem. We show that the LP relaxation of the second representation is tighter than the LP relaxation of the first one. As a direct implication, the Branch-and-Cut effort can be reduced. Computational results are reported on a set of large-scale instances. The preparation of this paper is partially supported by DGICYT through grant PB95-0407     

A Parallel Interior Point Method and Its Application to Facility Location Problems

We present a parallel interior point algorithm to solve block structured linear programs. This algorithm can solve block diagonal linear programs with both side constraints (common rows) and side variables (common columns). The performance of the algorithm is investigated on uncapacitated, capacitated and stochastic facility location problems. The facility location problems are formulated as mixed integer linear programs. Each subproblem of the branch and bound phase of the MIP is solved using the parallel interior point method. We compare the total time taken by the parallel interior point method with the simplex method to solve the complete problems, as well as the various costs of reoptimisation of the non-root nodes of the branch and bound. Computational results on two parallel computers (Fujitsu AP1000 and IBM SP2) are also presented in this paper.