Sciweavers

MP
1998
134views more  MP 1998»
14 years 3 days ago
Second-order global optimality conditions for convex composite optimization
In recent years second-order sufficient conditions of an isolated local minimizer for convex composite optimization problems have been established. In this paper, second-order opt...
Xiaoqi Yang
MP
1998
105views more  MP 1998»
14 years 3 days ago
Balinski-Tucker simplex tableaus: Dimensions, degeneracy degrees, and interior points of optimal faces
This paper shows the relationship between degeneracy degrees and multiplicities in linear programming models. The usual definition of degeneracy is restricted to vertices of a po...
Gert A. Tijssen, Gerard Sierksma
MP
1998
108views more  MP 1998»
14 years 3 days ago
Base polytopes of series-parallel posets: Linear description and optimization
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
Rainer Schrader, Andreas S. Schulz, Georg Wambach
MP
1998
61views more  MP 1998»
14 years 3 days ago
A branch and bound method for stochastic global optimization
Vladimir I. Norkin, Georg Ch. Pflug, Andrezj Ruszc...
MP
1998
83views more  MP 1998»
14 years 3 days ago
A modified layered-step interior-point algorithm for linear programming
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The algorithm accelerates the path following interior-point algorithm and its arithmetic complexity dep...
Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya
MP
1998
113views more  MP 1998»
14 years 3 days ago
Generalized semi-infinite optimization: A first order optimality condition and examples
We consider a generalized semi-infinite optimization problem (GSIP) of the form (GSIP) min{f(x) Ix E M}, where M = {x E N"lhi(x ) = 0, i = 1,...,m, G(x,y) /> 0, y E Y(x)} ...
Hubertus Th. Jongen, Jan-J. Rückmann, Oliver ...
MP
1998
73views more  MP 1998»
14 years 3 days ago
On proving existence of feasible points in equality constrained optimization problems
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
R. Baker Kearfott
MP
1998
76views more  MP 1998»
14 years 3 days ago
Warm start of the primal-dual method applied in the cutting-plane scheme
A practical warm-start procedure is described for the infeasible primal-dualinterior-point method employed to solve the restricted master problem within the cutting-plane method. ...
Jacek Gondzio
MP
1998
63views more  MP 1998»
14 years 3 days ago
Partitioning mathematical programs for parallel solution
Michael C. Ferris, Jeffrey D. Horn
MP
1998
117views more  MP 1998»
14 years 3 days ago
The node capacitated graph partitioning problem: A computational study
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
Carlos Eduardo Ferreira, Alexander Martin, C. Carv...