Abstract
An optimization problem is defined as the search for a minimum or a maximum (the optimum) of a function. We can also find optimization problems for which the variables of the function to be optimized are constrained to evolve in a precisely defined area of the search space. In this case, we have a particular kind of optimization called constrained optimization problem.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Annotated bibliography
This article presents various domination relations. It uses a very mathemathical presentation but is a good starting point for an overview of these relations.
This is an introductory book about operational research. All the domains of operational research are introduced through a very didactic presentation (linear programming, game theory and nonlinear programming). Many well-commented examples illustrate the presentation of each method.
This book, as indicated by the title, is entirely dedicated to multiobjective optimization. The basic concepts are presented through a mathematical discussion. This book deals mostly with a priori and progressive methods. The main mathematical characteristics of the methods are presented.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Collette, Y., Siarry, P. (2004). Introduction: multiobjective optimization and domination. In: Multiobjective Optimization. Decision Engineering. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-08883-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-08883-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07283-3
Online ISBN: 978-3-662-08883-8
eBook Packages: Springer Book Archive