A new exterior point algorithm for linear programming problems

A new exterior point algorithm for linear programming problems

0.00 Avg rating—0 Votes
Article ID: iaor19951882
Country: Serbia
Volume: 4
Start Page Number: 137
End Page Number: 148
Publication Date: Oct 1994
Journal: Yugoslav Journal of Operations Research
Authors: ,
Keywords: optimization
Abstract:

The authors present a simplex type algorithm for the linear programming problem min{cTëx:Aëx=b,x≥0}. It solves a sequence of problems of increasing dimension. The path generated by the algorithm contains basic solutions that are neither primal nor dual feasible. Results from an elementary computational study are also presented.

Reviews

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