The transformation of lexicographic nonlinear multi-objective programs into single objective programs

This paper deals with multi-objective optimization problems in which the objective functions are ordered by their degree of priority, and which have many applications in optimization and control theory. A number of approaches have been proposed (and several implemented) for the solution of lexicographic (preemptive priority) multi-objective programming problems. These approaches may be divided into two classes. The first encompasses the development of algorithms specifically designed to deal directly with the initial model. Considered only for linear multi-objective programs and multi-objective programs with a finite discrete feasible region, the second one attempts to transform, efficiently, the lexicographic multi-objective model into an equivalent model, i.e. a single objective programming problem. In this paper, we deal with the second approach for lexicographic nonlinear multi-objective programs.

کلیدواژه ها:

Multi-objective Programming ، Vector Optimization ، Preemptive Priority ، Lexicographic Ordering