We consider two partitions over the space of linear semi-infinite programming parameters with a fixed index set and bounded coefficients (the functions of the constraints are bounded). The first one is the primal-dual partition inspired by consistency and boundedness of the optimal value of the linear semi-infinite optimization problems. The second one is a refinement of the primal-dual partition that arises considering the boundedness of the optimal set. These two partitions have been studied in the continuous case, this is, the set of indices is a compact infinite compact Hausdorff topological space and the functions defining the constraints are continuous. In this work, we present an extension of this case. We study same topological properties of the cells generated by the primal-dual partitions and characterize their interior. Through examples, we show that the results characterizing the sets of the partitions in the continuous case are neither necessary nor sufficient in both refinements. In addition, a sufficient condition for the boundedness of the optimal set of the dual problem has been presented.
Previous Article in event Previous Article in congress
Next Article in event Next Article in congress
Primal-dual and general primal-dual partitions in linear semi-infinite programming with bounded coefficients
Published: 29 November 2018 by MDPI in MOL2NET'18, Conference on Molecular, Biomed., Comput. & Network Science and Engineering, 4th ed. congress USEDAT-04: USA-Europe Data Analysis Training Program Workshop, Cambridge, UK-Bilbao, Spain-Miami, USA, 2018
Keywords: Linear semi-infinite programming; bounded linear semi-infinite optimization problems; primal-dual partition.