Nonlinear Multiobjective OptimizationProblems with multiple objectives and criteria are generally known as multiple criteria optimization or multiple criteria decision-making (MCDM) problems. So far, these types of problems have typically been modelled and solved by means of linear programming. However, many real-life phenomena are of a nonlinear nature, which is why we need tools for nonlinear programming capable of handling several conflicting or incommensurable objectives. In this case, methods of traditional single objective optimization and linear programming are not enough; we need new ways of thinking, new concepts, and new methods - nonlinear multiobjective optimization. Nonlinear Multiobjective Optimization provides an extensive, up-to-date, self-contained and consistent survey, review of the literature and of the state of the art on nonlinear (deterministic) multiobjective optimization, its methods, its theory and its background. The amount of literature on multiobjective optimization is immense. The treatment in this book is based on approximately 1500 publications in English printed mainly after the year 1980. Problems related to real-life applications often contain irregularities and nonsmoothnesses. The treatment of nondifferentiable multiobjective optimization in the literature is rather rare. For this reason, this book contains material about the possibilities, background, theory and methods of nondifferentiable multiobjective optimization as well. This book is intended for both researchers and students in the areas of (applied) mathematics, engineering, economics, operations research and management science; it is meant for both professionals and practitioners in many different fields of application. The intention has been to provide a consistent summary that may help in selecting an appropriate method for the problem to be solved. It is hoped the extensive bibliography will be of value to researchers. |
Contents
V | 3 |
VI | 5 |
IX | 6 |
X | 10 |
XI | 14 |
XII | 15 |
XIV | 16 |
XV | 18 |
CII | 149 |
CIV | 151 |
CV | 152 |
CVI | 153 |
CVIII | 154 |
CX | 158 |
CXI | 159 |
CXII | 160 |
XVI | 19 |
XVII | 21 |
XVIII | 23 |
XIX | 25 |
XX | 26 |
XXI | 27 |
XXII | 29 |
XXIII | 33 |
XXIV | 37 |
XXVII | 42 |
XXVIII | 43 |
XXIX | 45 |
XXX | 47 |
XXXI | 52 |
XXXII | 54 |
XXXIII | 56 |
XXXIV | 59 |
XXXV | 61 |
XXXVI | 67 |
XXXIX | 69 |
XL | 71 |
XLIII | 73 |
XLIV | 75 |
XLVI | 77 |
XLVII | 78 |
XLIX | 82 |
L | 83 |
LI | 84 |
LII | 85 |
LIV | 88 |
LV | 89 |
LVI | 92 |
LVII | 94 |
LVIII | 95 |
LIX | 96 |
LX | 97 |
LXII | 98 |
LXIII | 99 |
LXIV | 100 |
LXVI | 103 |
LXVII | 106 |
LXIX | 107 |
LXXI | 108 |
LXXII | 110 |
LXXIII | 112 |
LXXV | 115 |
LXXVIII | 116 |
LXXIX | 117 |
LXXX | 118 |
LXXXII | 120 |
LXXXIV | 121 |
LXXXVI | 122 |
LXXXVII | 126 |
LXXXVIII | 127 |
LXXXIX | 129 |
XC | 131 |
XCI | 136 |
XCIII | 137 |
XCIV | 140 |
XCV | 141 |
XCVIII | 143 |
XCIX | 146 |
CI | 148 |
CXIII | 161 |
CXV | 162 |
CXVI | 163 |
CXVII | 164 |
CXIX | 165 |
CXXI | 167 |
CXXIII | 169 |
CXXIV | 170 |
CXXVI | 171 |
CXXVII | 173 |
CXXIX | 174 |
CXXXII | 176 |
CXXXIII | 177 |
CXXXIV | 178 |
CXXXVI | 179 |
CXXXVIII | 180 |
CXXXIX | 182 |
CXL | 183 |
CXLI | 184 |
CXLIV | 185 |
CXLV | 187 |
CXLVI | 189 |
CXLVII | 190 |
CXLIX | 192 |
CL | 193 |
CLII | 195 |
CLIV | 197 |
CLV | 198 |
CLVII | 201 |
CLVIII | 203 |
CLIX | 205 |
CLXI | 206 |
CLXII | 207 |
CLXIII | 208 |
CLXV | 209 |
CLXVI | 210 |
CLXVII | 211 |
CLXVIII | 215 |
CLXIX | 217 |
CLXX | 218 |
CLXXI | 219 |
CLXXII | 220 |
CLXXIII | 221 |
CLXXV | 225 |
CLXXVI | 226 |
CLXXVII | 227 |
CLXXIX | 228 |
CLXXX | 229 |
CLXXXI | 233 |
CLXXXIII | 235 |
CLXXXIV | 239 |
CLXXXV | 240 |
CLXXXVIII | 242 |
CLXXXIX | 243 |
CXCI | 244 |
CXCII | 245 |
CXCIII | 246 |
CXCIV | 247 |
CXCV | 251 |
CXCVI | 255 |
CXCVII | 257 |
| 293 | |
Other editions - View all
Common terms and phrases
achievement function algorithm alternatives Applications aspiration levels assumed assumptions beam search Chankong and Haimes computational constraint functions constraint qualification continuously differentiable convergence convex decision maker decision vector Definition denoted e-constraint method e-constraint problem efficient example exist feasible region fi(x final solution GDF method goal programming ideal objective vector interactive methods iteration Karush-Kuhn-Tucker Korhonen lexicographic ordering linear Linear Programming marginal rates Mathematical minimize MOLP problems MPB method multiobjective optimization problem nadir objective vector NIMBUS nonconvex nondifferentiable nonlinear objective functions objective values Operational Research optimality conditions Pareto optimal set Pareto optimal solutions presented Proof properly Pareto optimal rates of substitution reference point method Sakawa scalarizing function selection solution method solution process solved specify Steuer subproblem Subsection sufficient condition Tchebycheff method Theorem tion trade-off rates underlying value function upper bounds weakly Pareto optimal weighted Tchebycheff problem weighting coefficients weighting method weighting vector Wierzbicki znad
Popular passages
Page 289 - M. Meika, An Integration of Efficiency Projections into the Geoffrion Approach for Multiobjective Linear Programming, European Journal of Operational Research 16, No.
Page 269 - Theory and Decision Library, Series B: Mathematical and Statistical Methods, D. Reidel Publishing Company, 1987. Kaliszewski I., A Characterization of Properly Efficient Solutions by an Augmented Tchebycheff Norm, Bulletin of the Polish Academy of Sciences - Technical Sciences 33, No. 7-8 (1985), 415-420. , Norm Scalarization and Proper Efficiency in Vector Optimization, Foundations of Control Engineering 11, No.
Page 283 - ... Nonpreemptive Multi-Objective Programming: Relationships and Counterexamples, Journal of Optimization Theory and Applications 39, No. 2 (1983), 173-186. Shin WS, A. Ravindran, Interactive Multiple Objective Optimization: Survey I - Continuous Case, Computers and Operations Research 18, No. 1 (1991), 97-114. , A Comparative Study of Interactive Tradeoff Cutting Plane Methods for MOMP, European Journal of Operational Research 56, No.


