Multiobjective Optimisation Methods
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.
KeywordsIdeal Point Objective Space Biological Oxygen Demand Multiple Criterion Decision Constraint Method
Unable to display preview. Download preview PDF.