The main object of this paper is to give conditions under which a minimal solution to a
problem of mathematical programming can be transformed into a minimum solution in the
usual sense of the order relations, or in every case, conditions under which that solution is
adherent to the set of the points wich verify this last property. The interest of this problem
is clear, since many of the usual properties in optimization (like, for instance, the analysis of
the sensitivity of the solutions) are studied more easily for minimum solutions than for
minimal solutions
