Characterizations of interiors of feasible and infeasible data instances and feasibility for conic linear programming |
| |
| Authors: | Qinghong Zhang |
| |
| Institution: | 1.Department of Mathematics and Computer Science,Northern Michigan University,Marquette,USA |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
