Simplex-like trajectories on quasi-polyhedral sets

Simplex-like trajectories on quasi-polyhedral sets

0.00 Avg rating0 Votes
Article ID: iaor20041218
Country: United States
Volume: 26
Issue: 1
Start Page Number: 147
End Page Number: 162
Publication Date: Feb 2001
Journal: Mathematics of Operations Research
Authors: , ,
Keywords: sets
Abstract:

This paper presents a unified treatment of two new simplex-like methods for linear semi-infinite programming problems with quasi-polyhedral feasible sets. The simplex method combines a purification phase I (which provides an extreme point from a given feasible solution) with the iterative application of a pivot operation, yielding a trajectory which consists of a (possibly infinite) sequence of linked edges (phase II). The reduced gradient method also consists of two phases and it can be applied even when the feasible set has no extreme point.

Reviews

Required fields are marked *. Your email address will not be published.