Multiobjective Programming and Goal Programming: Theoretical Results and Practical ApplicationsVincent Barichard, Xavier Gandibleux, Vincent T'Kindt Springer Science & Business Media, 30 janv. 2009 - 298 pages Part I Multiobjective Programming and Goal-Programming: A Constraint Method in Nonlinear Multiobjective Optimization.- A New Approach to Duality in Vector Optimization.- Optimality of the Methods for Approximating the Feasible Criterion Set in the Convex Case.- Introducing Non-Polyhedral Cones to Multiobjective Programming.- A GP Formulation for Aggregating Preferences with Interval Assessments.- Part II Multiobjective Combinatorial Optimization: Bicriterion Shortest Paths in Stochastic Time-Dependent Networks.- Clusters of Non-Dominated Solutions in Multiobjective Combinatorial Optimization: An Experiment Analysis.- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem.- Constraint Optimization Techniques for Exact Multiobjective Optimization.- Outer Branching: How to Optimize under Partial Orders?.- Part III Multiobjective Metheuristics: On Utilizing Infeasibility in Multiobjective Evolutionary Algorithms.- The Effect of Initial Population Sampling on the Convergence of Multiobjective Genetic Algorithms.- Pattern Mining for Historical Data Analysis by Using MOEA.- Multiobjective Genetic Algorithm Using the Multiple Criteria Decision Making Method TOPSIS.- Part IV Multiobjective Games and Uncertainty: Multi-Criteria Simple Games.- Multiobjective Cooperative Games with Restrictions on Coalitions.- An Experimental Investigation of the Optimal Selection Problem with Two Decision Makers.- Solving a Fuzzy Multiobjective Linear Programming Problem Through the Value and the Ambiguity of Fuzzy Numbers.- A Robust-Solution-Based Methodology to Solve Multiobjective Problems with Uncertainty.- Part V Interactive Methods and Applications: On the Use of Preferential Weights in Interactive Reference Point Based Methods.- Interactive Multiobjective Optimization of Superstructure SMB Processes.- Scheduling of Water Distribution Systems Using an Multiobjective Approach.- On Conditional Value-at-Risk Based Goal Programming Portfolio Selection Procedure.- Optimal Bed Allocation in Hospitals.- Multiobjective (Combinatorial) Optimization - Some Thoughts on Applications.- Multiscenario Multiobjective Optimization with Application in Engineering Design. |
Table des matières
A Constraint Method in Nonlinear MultiObjective Optimization Gabriele Eichfelder | 3 |
The Attainment of the Solution of the Dual Program in Vertices | 13 |
Optimality of the Methods for Approximating the Feasible Criterion | 25 |
Introducing Nonpolyhedral Cones to Multiobjective Programming | 35 |
A GP Formulation for Aggregating Preferences with Interval | 46 |
Bicriterion Shortest Paths in Stochastic TimeDependent Networks | 57 |
Clusters of Nondominated Solutions in Multiobjective Combinatorial | 68 |
Computational Results for Four Exact Methods | 79 |
Máximo Méndez Computer Science Department University of Las Palmas | 145 |
MultiCriteria Simple Games | 157 |
Tetsuzo Tanino Osaka University Suita Osaka 5650871 Japan taninoeei | 167 |
An Experimental Investigation of the Optimal Selection Problem | 175 |
Mariano Jiménez Universidad del País Vasco Plaza Oñati 1 20018San | 186 |
A RobustSolutionBased Methodology to Solve MultipleObjective | 197 |
Interactive Multiobjective Optimization of Superstructure | 221 |
On Conditional ValueatRisk Based Goal Programming Portfolio | 242 |
Constraint Optimization Techniques for Exact MultiObjective | 89 |
Ulrich Junker ILOG 1681 route des Dolines F06560 Valbonne France | 99 |
On Utilizing Infeasibility in Multiobjective Evolutionary Algorithms | 113 |
Pattern Mining for Historical Data Analysis by Using MOEA 135 | 134 |
Multiobjective Combinatorial Optimisation Some Thoughts | 267 |
Multiscenario Multiobjective Optimization with Applications | 283 |
Autres éditions - Tout afficher
Expressions et termes fréquents
application approach approximation Barichard Berlin Heidelberg 2009 biobjective bound set branch and bound BTSP coalition combinatorial Comput consider constraints convex cost criteria criterion CVaR defined dominated Economics and Mathematical efficient frontier efficient set efficient solutions Ehrgott evolutionary algorithms feasible genetic algorithm Goal Programming hypervolume infeasible instances interval Kriging Lecture Notes linear programming Mathematical Systems 618 matrix method minimal MO-BB MO-MBE MOEA multi-criteria simple game multiobjective optimization Multiobjective Programming multiple networks node non-dominated solutions nondominated points nonpolyhedral cone normalized hypervolume Notes in Economics NSGA-II objective function obtained Oper Res optimal solution optimization problems outcome p-vectors parameter Pareto front Pareto optimal partial order patterns players polyhedral preferences Programming and Goal proposed random rank route choice scalar Sobol solve space stochastic stopping rules strict partial order subproblems subset Theorem tion TOPSISGA utility values variables vector weights ZDT1