Multiobjective Optimisation Methods

  • Enrique Ballestero
  • Carlos Romero
Chapter

Abstract

Multiobjective programming (MOP) -also called vectorial optimisation- is a MCDM approach facing the problem of simultaneous maximisation or minimisation of several objectives subject to a set of constraints. As simultaneous optimisation of all the objectives is not possible -given a certain level of conflict between them in most of real problems- MOP tries to find the set of Pareto efficient solutions, as described in the preceding chapter, instead of trying to determine a non-existent optimum. In other words, MOP aims to establish a partition of the feasible set into two subsets: the subset of Paretian efficient solutions and the subset of inferior or non-efficient solutions.

Keywords

Ideal Point Objective Space Biological Oxygen Demand Multiple Criterion Decision Constraint Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Enrique Ballestero
    • 1
  • Carlos Romero
    • 1
  1. 1.Technical University of MadridSpain

Personalised recommendations