In this paper an interactive procedure for solving multi-objective programming problem has been developed. Algorithm for the convex case is based on some elements of the theory of convex programming irrespective of any constraint qualification. Sensitivity analysis of the convex program by marginal value formula from the input optimization provides necessary information to help the user in the dialog part of the procedure.