Page 1 Next

Displaying 1 – 20 of 51

Showing per page

Bottleneck capacity expansion problems with general budget constraints

Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang (2001)

RAIRO - Operations Research - Recherche Opérationnelle

This paper presents a unified approach for bottleneck capacity expansion problems. In the bottleneck capacity expansion problem, BCEP, we are given a finite ground set E , a family of feasible subsets of E and a nonnegative real capacity c ^ e for all e E . Moreover, we are given monotone increasing cost functions f e for increasing the capacity of the elements e E as well as a budget B . The task is to determine new capacities c e c ^ e such that the objective function given by max F min e F c e is maximized under the side constraint...

Bottleneck Capacity Expansion Problems with General Budget Constraints

Rainer E. Burkard, Bettina Klinz, Jianzhong Zhang (2010)

RAIRO - Operations Research

This paper presents a unified approach for bottleneck capacity expansion problems. In the bottleneck capacity expansion problem, BCEP, we are given a finite ground set E, a family F of feasible subsets of E and a nonnegative real capacity ĉe for all e ∈ E. Moreover, we are given monotone increasing cost functions fe for increasing the capacity of the elements e ∈ E as well as a budget B. The task is to determine new capacities ce ≥ ĉe such that the objective function given by maxF∈Fmine∈Fce...

Comparison between different duals in multiobjective fractional programming

Radu Boţ, Robert Chares, Gert Wanka (2007)

Open Mathematics

The present paper is a continuation of [2] where we deal with the duality for a multiobjective fractional optimization problem. The basic idea in [2] consists in attaching an intermediate multiobjective convex optimization problem to the primal fractional problem, using an approach due to Dinkelbach ([6]), for which we construct then a dual problem expressed in terms of the conjugates of the functions involved. The weak, strong and converse duality statements for the intermediate problems allow...

Convergence of prox-regularization methods for generalized fractional programming

Ahmed Roubi (2002)

RAIRO - Operations Research - Recherche Opérationnelle

We analyze the convergence of the prox-regularization algorithms introduced in [1], to solve generalized fractional programs, without assuming that the optimal solutions set of the considered problem is nonempty, and since the objective functions are variable with respect to the iterations in the auxiliary problems generated by Dinkelbach-type algorithms DT1 and DT2, we consider that the regularizing parameter is also variable. On the other hand we study the convergence when the iterates are only...

Convergence of Prox-Regularization Methods for Generalized Fractional Programming

Ahmed Roubi (2010)

RAIRO - Operations Research

We analyze the convergence of the prox-regularization algorithms introduced in [1], to solve generalized fractional programs, without assuming that the optimal solutions set of the considered problem is nonempty, and since the objective functions are variable with respect to the iterations in the auxiliary problems generated by Dinkelbach-type algorithms DT1 and DT2, we consider that the regularizing parameter is also variable. On the other hand we study the convergence when the iterates are only ηk-minimizers...

Currently displaying 1 – 20 of 51

Page 1 Next