Generic primal-dual solvability in continuous linear semi-infinite programming

In this article, we consider the space of all the linear semi-infinite programming (LSIP) problems with a given infinite compact Hausdorff index set, a given number of variables and continuous coefficients, endowed with the topology of the uniform convergence. These problems are classified as inconsistent, solvable with bounded optimal set, bounded (i.e. finite valued), but either unsolvable or having an unbounded optimal set, and unbounded (i.e. with infinite optimal value), giving rise to the so-called refined primal partition of the space of problems. The mentioned LSIP problems can be also classified with a similar criterion applied to the corresponding Haar's dual problems, which provides the refined dual partition of the space of problems. We characterize the interior of the elements of the refined primal and dual partitions as well as the interior of the intersections of the elements of both partitions (the so-called refined primal-dual partition). These characterizations allow to prove that most (primal or dual) bounded problems have simultaneously primal and dual non-empty bounded optimal set. Consequently, most bounded continuous LSIP problems are primal and dual solvable.Research supported by DGES and FEDER, Grant MTM2005-08572-C03-01. Research partially supported by CONACyT of MX. Grant 55681