Abstract
In this paper, we present simple proofs for the main results that appear in Nunez (Math Program 91:375–390, 2002) using a lemma in Freund and Vera (Math Program 86:225–260, 1999) for conic linear programming. Connections between interiors and boundaries of feasible and infeasible data instances and weak and strong feasibilities of a conic linear programming primal-dual pair are made.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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 call
