On the connectedness of optimum-degeneracy graphs

On the connectedness of optimum-degeneracy graphs

0.00 Avg rating0 Votes
Article ID: iaor19991392
Country: Netherlands
Volume: 95
Issue: 1
Start Page Number: 155
End Page Number: 166
Publication Date: Nov 1996
Journal: European Journal of Operational Research
Authors: ,
Keywords: programming: linear
Abstract:

So-called optimum-degeneracy graphs describe the structure of the set of primal and dual feasible bases associated with a degenerate vertex of the feasible solution set of a linear program. The structural properties of these graphs play an important role in determining shadow prices or performing sensitivity analysis in linear programming under degeneracy. We prove that general optimum-degeneracy graphs are connected and that negative optimum-degeneracy graphs are connected under certain conditions.

Reviews

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