| Article ID: | iaor20104904 |
| Volume: | 4 |
| Issue: | 3 |
| Start Page Number: | 439 |
| End Page Number: | 447 |
| Publication Date: | Aug 2010 |
| Journal: | Optimization Letters |
| Authors: | Zhang Qinghong |
| Keywords: | Programming (cone) |
In this paper, we present simple proofs for the main results that appear in Nunez (2002) using a lemma in Freund and Vera (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.