In this paper we derive a lower bound on the average complexity of the Simplex-Method as a solution-process for linear programs (LP) of the type:<Equation ID="Equ1"> <EquationSource Format="TEX"/> </Equation> We assume these problems to be randomly generated according to the Rotation-Symmetry-Model: *Let a <Subscript>1</Subscript>,…,a <Subscript>m</Subscript>, v be distributed independently,...</subscript></subscript></equation>

In a series of papers, Hiriart-Urruty proposed necessary and sufficient global optimality conditions for the so-called d.c. problem and the convex maximization problem. In this paper, we investigate the underlying local optimality conditions, which, in general, are necessary, but not sufficient...

To solve linear programming problems by interior point methods an approximately centered interior point has to be known. Such a point can be found by an algorithmic approach - a so-called phase 1 algorithm or centering algorithm. For random linear programming problems distributed according to...

In this paper we derive a lower bound on the average complexity of the Simplex-Method as a solution-process for linear programs (LP) of the type: We assume these problems to be randomly generated according to the Rotation-Symmetry-Model: *Let a 1 ,…,a m , v be distributed independently,...

In a series of papers, Hiriart-Urruty proposed necessary and sufficient global optimality conditions for the so-called d.c. problem and the convex maximization problem. In this paper, we investigate the underlying local optimality conditions, which, in general, are necessary, but not sufficient...

In this paper we introduce and investigate an optimality concept for set-valued optimization problems with variable ordering structure. In our approach, the ordering structure is governed by a set-valued map acting between the same spaces as the objective multifunction. Necessary optimality...