A branch and bound algorithm for the robust shortest path problem with interval data

Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs.A branch and bound algorithm for this problem is presented.     

Robust linear optimization under general norms

We explicitly characterize the robust counterpart of a linear programming problem with uncertainty set described by an arbitrary norm. Our approach encompasses several approaches from the literature and provides guarantees for constraint violation under probabilistic models that allow arbitrary dependencies in the distribution of the uncertain coefficients.     

Strongly polynomial-time approximation for a class of bicriteria problems

Consider the following problem: given a ground set and two minimization objectives of the same type find a subset from a given subset-class that minimizes the first objective subject to a budget constraint on the second objective. Using Megiddo's parametric method we improve an earlier weakly polynomial time algorithm.     

A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

We propose in this work a hybrid improvement procedure for the bin packing problem. This heuristic has several features: the use of lower bounding strategies; the generation of initial solutions by reference to the dual min-max problem; the use of load redistribution based on dominance, differencing, and unbalancing; and the inclusion of an improvement process utilizing tabu search. Encouraging results have been obtained for a very wide range of benchmark instances, illustrating the robustness of the algorithm. The hybrid improvement procedure compares favourably with all other heuristics in the literature. It improved the best known solutions for many of the benchmark instances and found the largest number of optimal solutions with respect to the other available approximate algorithms.     

单调全局最优化问题的凸化外逼近算法

单调优化是指目标函数与约束函数均为单调函数的全局优化问题．本文提出一种新的凸化变换方法把单调函数化为凸函数，进而把单调优化问题化为等价的凸极大或凹极小问题，然后采用Hoffman的外逼近方法来求得问题的全局最优解．我们把这种凸化方法同Tuy的Polyblock外逼近方法作了比较，通过数值比较可以看出本文提出的凸化的方法在收敛速度上明显优于Polyblock方法．     

Hyperspaces of Normed Linear Spaces with the Attouch–Wets Topology

Let Cld _AW (X) be the hyperspace of nonempty closed subsets of a normed linear space X with the Attouch–Wets topology. It is shown that the space Cld _AW (X) and its various subspaces are AR's. Moreover, if X is an infinite-dimensional Banach space with weight w(X) then Cld _AW (X) is homeomorphic to a Hilbert space with weight 2 ^w(X).     

On a Class of Functionals Whose Local Minima are Global

In this note we introduce a suitable class of functionals, including the class of integral functionals, and prove that any (strict) local minimum of a functional of this class, defined on a decomposable space, is a (strict) global minimum. So, the recent result obtained by Giner in [1] is specified and extended.     

A Bicriterial Optimization Problem of Antenna Design

In this paper we consider a special optimization problem withtwo objectives which arises in antenna theory. It is shown that thisabstract bicriterial optimization problem has at least one solution.Discretized versions of this problem are also discussed, and therelationships between these finite dimensional problems and the infinitedimensional problem are investigated. Moreover, we presentnumerical results for special parameters using a multiobjectiveoptimization method.     

多级制造系统的最优化模型及其应用

多级制造系统是现代制造业的主要加工方式，系统的每一级的加工速度和加工周期是系统设计的主要决策变量，正确确定这两个变量是系统得到优化的主要目标。本文导出了系统优化的基本模型，它包括系统各级的生产时间、等待时间、生产速度、生产成本以及系统的循环时间、总成本、产品利润和利润率等，并给出了一个应用实例。