Convex multiobjective programming problems and multiplicative programming problems have important applications in areas such as finance, economics, bond portfolio optimization, engineering, and other fields. This paper presents a quite easy algorithm for generating a number of efficient outcome solutions for convex multiobjective programming problems. As an application, we propose an outer appr...

In general nonlinear programming problems to find a solution which minimizes an objective function under given constraints, one whose objective function and constraint region are convex is called a convex programming problem. For such convex programming problems, there have been proposed many efficient solution method as the successive quadratic programming method and the general gradient metho...

In this paper, we focus on hierarchical multiobjective linear programming problems where multiple decision makers in a hierarchical organization have their own multiple objective linear functions together with common linear constraints, and propose an interactive decision making method to obtain a satisfactory solution which reflects not only the hierarchical relationships between multiple deci...