A rational procedure is developed for ranking the multiobjectives of a vector maximum problem, thereby leading to proper assignment of weights to the objectives. To achieve this, we determine the range of each decision variable from the constraints set and transform them into the unit interval. After scaling the decision variables, we scale down the objectives also into the unit interval. Following Yager (1981), an ordering function of the objectives is determined. This ordering function value is nothing but the strength of preference inherent in the objectives. Accepting the strength of preference, we obtain the weights for the respective objectives. A numerical example is given to illustrate the procedure.