Journal ArticleDOI
Pivoting rules and redundancy schemes in extreme point enumeration
Reads0
Chats0
TLDR
In this paper, the authors give an overview over how problems connected to degeneracy have been attacked in the literature in connection with extreme point enumeration in a convex polyhedron.Abstract:
We give an overview over how problems connected to degeneracy have been attacked in the literature in connection with extreme point enumeration in a convex polyhedron. We treat both the question of unique pivots and how to attach only one basis to each extreme point.read more
Citations
More filters
Journal ArticleDOI
Robust point correspondence by concave minimization
João Maciel,João Paulo Costeira +1 more
TL;DR: A new methodology is proposed for reliably solving the correspondence problem between points of two or more images, able to handle most of the commonly used assumptions in a unique formulation, independent of the domain of application and type of features.
Journal ArticleDOI
Enumerative techniques for solving some nonconvex global optimization problems
TL;DR: In this article, the authors give an overview on different methods for solving nonconvex minimization problems using techniques of enumeration of extreme points, including concave, indefinite quadratic, and special structured problems such as the concave cost network flow problem.
Journal ArticleDOI
Selected bibliography on degeneracy
TL;DR: A selected bibliography on degeneracy problems organized according to the appearance of the respective references in various fields of operations research is given.
Journal ArticleDOI
Degeneracy graphs: theory and application an updated survey
TL;DR: A survey of various aspects of the theory and application of degeneracy graphs (DGs) is given, and the impact of weakly redundant constraints on various postoptimal analyses under degeneracy is briefly described.
Journal ArticleDOI
An improved N-tree algorithm for the enumeration of all neighbors of a degenerate vertex
TL;DR: A special lexicographic pivot selection strategy is presented which leads to an improved version of the N-tree method and the increase in efficiency is illustrated by test results.
References
More filters
Book
Linear Programming and Extensions
TL;DR: This classic book looks at a wealth of examples and develops linear programming methods for their solutions and begins by introducing the basic theory of linear inequalities and describes the powerful simplex method used to solve them.
Journal ArticleDOI
The generalized simplex method for minimizing a linear form under linear inequality restraints
Journal ArticleDOI
New Finite Pivoting Rules for the Simplex Method
TL;DR: A simple proof of finiteness is given for the simplex method under an easily described pivoting rule and a second new finite version of thesimplex method is presented.