The weighted approach can be more formalized by using a divide-and-conquer method to determine the complete set of convex Pareto-optimal solutions with minimal iterations. While old, a good and clear overview of this approach can be found in:
Cohon, J. L., Church, R. L. and Sheer, D. P. 1979. Generating multiobjective trade-offs: an algorithm for bicriterion problems. Water Resources Research, 15(5), 1001-1010.
Note though that this weighting approach will only give you the set of convex Pareto-optimal solutions. If the variables are discrete rather than continuous, then there may non-convex solutions that require other methods such as adding additional resource constraints in order to get those solutions.