Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming (Q1958647)

Proofs with using a lemma of \textit{R. M. Freund} and \textit{J. R. Vera} [``Some characterizations and properties of the `distance to ill-posedness' and the condition measure of a conic linear system'', Math. Program. 86, No. 2 (A), 225--260 (1999; Zbl 0966.90048)] are presented for appeared main results of \textit{M. A. Nunez} [``A characterization of ill-posed data instance for convex programming'', Math. Program. 91, No. 2 (A), 375--390 (2002; Zbl 1049.90059)] with original proofs using the pseudo-inverse operator of Moore-Penrose inverse of \(A\) in the constraint\(Ax=b\) and lemmas that are not so simply. The last section is devoted to the feasibility of conic linear programming in which 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.