In the context of multiobjective linear programming (MOLP) problems where there is indetermination around some parameters, we suppose that the decision maker knows only the limits of variation of these parameters and eventually one of their central values. For such situations, we have proposed (cf. Urli and Nadeau, 1990) a general methodology wich enables us to transform the non deterministic MOLP problem into a deterministic one and after to solve the latter program by an interactive approach derived from the STEM method. In the present paper we develop a particular method based on that general methodology and we illustrate it by a didactic example.