This paper presents a new method for hi-objective optimization. Ordinary weighted sum method is easy to implement, but it has two significant drawbacks: (1) the solution distribution by the weighted sum method is not uniform, and (2) the method cannot determine any solutions that reside in non-convex regions of a Pareto front. The proposed adaptive weighted sum method does not solve a multiobjective optimization in a predetermined way, but it focuses on the regions that need more refinement by imposing additional inequality constraints. It is demonstrated that the adaptive weighted sum method produces uniformly distributed solutions and finds solutions on non-convex regions. Two numerical examples and a simple structural problem are presented to verify the performance of the proposed method.