In order to define the notion “solution” of an arbitary parametric linear programming problem with constant matrix of constraints whose coefficients of the objective function as well as the components of the right hand side vector depend in a very general manner on the parameters there are introduced some usefull notions. The most important among them is the “structure of a solution” which yields a partion of the setPof all parameters under consideration firstly into the unsolvability setP0and the solvability setPLwhich as complement toP0is an open set with respect toP. The setPLcan be divided into a finite number of maximal closed with respect toPsubsets which are characterized by a certain structure. The desired notion “solution” for a general parametric linear programming problem then represents finitely many pairs containing a partition set together with the corresponding structure. Besides of this mainly investigations there are studied unicity of a partition and related questions.