A reverse search algorithm for the neighborhood problem

A reverse search algorithm for the neighborhood problem

0.00 Avg rating0 Votes
Article ID: iaor20022455
Country: Netherlands
Volume: 25
Issue: 1
Start Page Number: 33
End Page Number: 37
Publication Date: Aug 1999
Journal: Operations Research Letters
Authors:
Abstract:

We describe an algorithm for the solution of the neighborhood problem and of a closely related sensitivity analysis question in linear programming. The algorithm performs a reverse search of feasible bases by means of lexicographic pivoting.

Reviews

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