Separation is a famous principle and separation properties are important for optimization theory and various applications. In practice, input data are rarely known exactly and it is advisable to deal with parameters. In this article, we are concerned with the basic characteristics (existence, description, stability etc.) of separating hyperplanes of two convex polyhedral sets depending on parameters. We study the case, when parameters are situated in one column of the constraint matrix from the description of the given convex polyhedral set. We provide also a lot of examples carried out on PC.