Different partitions of the parameter space of all linear semi-infinite programming problems with a fixed compact set of indices and continuous right and left hand side coefficients have been considered in this paper. The optimization problems are classified in a different manner, e.g., consistent and inconsistent, solvable (with bounded optimal value and nonempty optimal set), unsolvable (with bounded optimal value and empty optimal set) and unbounded (with infinite optimal value). The classification we propose generates a partition of the parameter space, called second general primal-dual partition. We characterize each cell of the partition by means of necessary and sufficient, and in some cases only necessary or sufficient conditions, assuring that the pair of problems (primal and dual), belongs to that cell. In addition, we show non emptiness of each cell of the partition and with plenty of examples we demonstrate that some of the conditions are only necessary or sufficient. Finally, we investigate various questions of stability of the presented partition.