Displaying 1101 – 1120 of 1943

Showing per page

On a dual network exterior point simplex type algorithm and its computational behavior

George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2012)

RAIRO - Operations Research - Recherche Opérationnelle

The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a solution that is both primal and dual feasible, i.e....

On a dual network exterior point simplex type algorithm and its computational behavior∗

George Geranis, Konstantinos Paparrizos, Angelo Sifaleras (2012)

RAIRO - Operations Research

The minimum cost network flow problem, (MCNFP) constitutes a wide category of network flow problems. Recently a new dual network exterior point simplex algorithm (DNEPSA) for the MCNFP has been developed. This algorithm belongs to a special “exterior point simplex type” category. Similar to the classical dual network simplex algorithm (DNSA), this algorithm starts with a dual feasible tree-solution and after a number of iterations, it produces a...

On a new solution concept for bargaining problems

Tadeusz Radzik (1998)

Applicationes Mathematicae

The purpose of this paper is to discuss the properties of a new solution of the 2-person bargaining problem as formulated by Nash, the so-called Average Pay-off solution. This solution of a very simple form has a natural interpretation based on the center of gravity of the feasible set, and it is "more sensitive" to changes of feasible sets than any other standard bargaining solution. It satisfies the standard axioms: Pareto-Optimality, Symmetry, Scale Invariance, Continuity and Twisting. Moreover,...

On a nonstationary discrete time infinite horizon growth model with uncertainty

Nikolaos S. Papageorgiou, Francesca Papalini, Susanna Vercillo (1997)

Commentationes Mathematicae Universitatis Carolinae

In this paper we examine a nonstationary discrete time, infinite horizon growth model with uncertainty. Under very general hypotheses on the data of the model, we establish the existence of an optimal program and we show that the values of the finite horizon problems tend to that of the infinite horizon as the end of the planning period approaches infinity. Finally we derive a transversality condition for optimality which does not involve dual variables (prices).

Currently displaying 1101 – 1120 of 1943