Abstract
This study is concerned with constrained optimization problems where the only inequality constraints are nonnegativity constraints on the variables. In these problems, the ability to identify zero variables (binding constraints) early on in an iterative method is of considerable value and can be used to computational advantage. This work first gives a formal presentation of the notion of indicators for identifying zero variables, and then studies various indicators proposed in the literature for use with interior-point methods for linear programming. Both theory and experimentation are presented that speak strongly against the use of the variables as indicators; perhaps the most frequently used indicator in the literature. This study implies that an indicator proposed by Tapia is particularly effective in the context of primal-dual interior-point methods. The local rate of convergence for several indicators is also studied.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
