Record:   Prev Next
作者 Engau, Alexander
書名 Domination and decomposition in multiobjective programming
說明 245 p
附註 Source: Dissertation Abstracts International, Volume: 68-03, Section: B, page: 1909
Adviser: Margaret M. Wiecek
Thesis (Ph.D.)--Clemson University, 2007
During the last few decades, multiobjective programming has received much attention for both its numerous theoretical advances as well as its continued success in modeling and solving real-life decision problems in business and engineering. In extension of the traditionally adopted concept of Pareto optimality, this research investigates the more general notion of domination and establishes various theoretical results that lead to new optimization methods and support decision making
After a preparatory discussion of some preliminaries and a review of the relevant literature, several new findings are presented that characterize the nondominated set of a general vector optimization problem for which the underlying domination structure is defined in terms of different cones. Using concepts from linear algebra and convex analysis, a well known result relating nondominated points for polyhedral cones with Pareto solutions is generalized to nonpolyhedral cones that are induced by positively homogeneous functions, and to translated polyhedral cones that are used to describe a notion of approximate nondominance. Pareto-oriented scalarization methods are modified and several new solution approaches are proposed for these two classes of cones. In addition, necessary and sufficient conditions for nondominance with respect to a variable domination cone are developed, and some more specific results for the case of Bishop-Phelps cones are derived
Based on the above findings, a decomposition framework is proposed for the solution of multi-scenario and large-scale multiobjective programs and analyzed in terms of the efficiency relationships between the original and the decomposed subproblems. Using the concept of approximate nondominance, an interactive decision making procedure is formulated to coordinate tradeoffs between these subproblems and applied to selected problems from portfolio optimization and engineering design
Some introductory remarks and concluding comments together with ideas and research directions for possible future work complete this dissertation
School code: 0050
DDC
Host Item Dissertation Abstracts International 68-03B
主題 Operations Research
0796
Alt Author Clemson University
Record:   Prev Next