The main purpose of this paper is to introduce a comprehensive study of vector optimization
problems (VOP). A new combined approach is developed for characterizing the efficient solutions
of (VOP). This approach combines the characteristics of both Tchebycheff norm approach and
K-th objective Lagrangian approach to form an improved scalarizing method for treating
nonlinear multiobjective optimization problems. The Combined procedure is sensible because the
Tchebycheff norm approach possesses complementary distinguishing characteristics for K-th
objective Lagrangian approach. The theorems which characterize the efficient solutions of (VOP)
in terms of this new combined approach are introduced. Also, some of the basic notions in
parametric convex programming are redefined and analyzed for the new combined approach.