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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Israel A., Charnes A., Kortanek K.: Duality and asymptotic solvability over cones. Bull. A.M.S. 74, 318–324 (1969)
Freund R.M., Vera J.R.: Some characterizations and properties of the “distance to ill-posedness” and the condition measure of a conic linear system. Math. Program. 86, 225–260 (1999)
Nunez M.A.: A characterization of ill-posed data instance for convex programming. Math. Program. 91, 375–390 (2002)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Zhang, Q. Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming. Optim Lett 4, 439–447 (2010). https://doi.org/10.1007/s11590-009-0171-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-009-0171-4