2014
DOI: 10.1016/j.compchemeng.2014.04.003
|View full text |Cite
|
Sign up to set email alerts
|

MILP-based decomposition algorithm for dimensionality reduction in multi-objective optimization: Application to environmental and systems biology problems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
8
1

Relationship

2
7

Authors

Journals

citations
Cited by 21 publications
(9 citation statements)
references
References 24 publications
0
9
0
Order By: Relevance
“…Note that model RSUMOD makes use of both, the surrogate model SURMOD obtained in step In order to solve problem RSUMOD and obtain a set ot Pareto optimal solutions, one can use any MOO method available in the literature [46][47][48][49]. Without loss of generality, here we use the epsilon constraint method [50,51], which consists of calculating a set of auxiliary singleobjective problems in which one objective is kept as main criterion while the others are transferred to auxiliary constraints and limited within allowable bounds.…”
Section: Moo Of the Surrogate Model In The Reduced Domainmentioning
confidence: 99%
“…Note that model RSUMOD makes use of both, the surrogate model SURMOD obtained in step In order to solve problem RSUMOD and obtain a set ot Pareto optimal solutions, one can use any MOO method available in the literature [46][47][48][49]. Without loss of generality, here we use the epsilon constraint method [50,51], which consists of calculating a set of auxiliary singleobjective problems in which one objective is kept as main criterion while the others are transferred to auxiliary constraints and limited within allowable bounds.…”
Section: Moo Of the Surrogate Model In The Reduced Domainmentioning
confidence: 99%
“…where There are many methods available to solve multi-objective optimization problems [73][74][75][76]. The solution of a MOO problem is given by a set of points (called Pareto solutions) that represent the optimal trade-off between the objectives considered in the analysis [40,77].…”
Section: Solution Proceduresmentioning
confidence: 99%
“…in less than 20 minutes with an optimality gap of 1%. However, bi-level decomposition methods [33][34][35][36]…”
Section: Spatial Decomposition Approachmentioning
confidence: 99%
“…in less than 20 min with an optimality gap of 1%. However, bilevel decomposition methods could enable the reduction of the required CPU time without significantly affecting the accuracy of the results, through a systematic identification and elimination of redundant criteria from the mathematical formulation. This could also support an extension to optimization under uncertainty.…”
Section: Spatial Decomposition Approachmentioning
confidence: 99%