Details
Original language | English |
---|---|
Pages (from-to) | 359-387 |
Number of pages | 29 |
Journal | Mathematical Methods of Operations Research |
Volume | 84 |
Issue number | 2 |
Publication status | Published - 1 Oct 2016 |
Externally published | Yes |
Abstract
This article deals with constrained multi-objective optimization problems. The main purpose of the article is to investigate relationships between constrained and unconstrained multi-objective optimization problems. Under suitable assumptions (e.g., generalized convexity assumptions) we derive a characterization of the set of (strictly, weakly) efficient solutions of a constrained multi-objective optimization problem using characterizations of the sets of (strictly, weakly) efficient solutions of unconstrained multi-objective optimization problems. We demonstrate the usefulness of the results by applying it on constrained multi-objective location problems. Using our new results we show that special classes of constrained multi-objective location problems (e.g., point-objective location problems, Weber location problems, center location problems) can be completely solved with the help of algorithms for the unconstrained case.
Keywords
- Constrained optimization, Gauges, Generalized convexity, Location theory, Multi-objective optimization, Pareto efficiency, Unconstrained optimization
ASJC Scopus subject areas
- Computer Science(all)
- Software
- Mathematics(all)
- General Mathematics
- Decision Sciences(all)
- Management Science and Operations Research
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Mathematical Methods of Operations Research, Vol. 84, No. 2, 01.10.2016, p. 359-387.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Relationships between constrained and unconstrained multi-objective optimization and application in location theory
AU - Günther, Christian
AU - Tammer, Christiane
N1 - Publisher Copyright: © 2016, Springer-Verlag Berlin Heidelberg.
PY - 2016/10/1
Y1 - 2016/10/1
N2 - This article deals with constrained multi-objective optimization problems. The main purpose of the article is to investigate relationships between constrained and unconstrained multi-objective optimization problems. Under suitable assumptions (e.g., generalized convexity assumptions) we derive a characterization of the set of (strictly, weakly) efficient solutions of a constrained multi-objective optimization problem using characterizations of the sets of (strictly, weakly) efficient solutions of unconstrained multi-objective optimization problems. We demonstrate the usefulness of the results by applying it on constrained multi-objective location problems. Using our new results we show that special classes of constrained multi-objective location problems (e.g., point-objective location problems, Weber location problems, center location problems) can be completely solved with the help of algorithms for the unconstrained case.
AB - This article deals with constrained multi-objective optimization problems. The main purpose of the article is to investigate relationships between constrained and unconstrained multi-objective optimization problems. Under suitable assumptions (e.g., generalized convexity assumptions) we derive a characterization of the set of (strictly, weakly) efficient solutions of a constrained multi-objective optimization problem using characterizations of the sets of (strictly, weakly) efficient solutions of unconstrained multi-objective optimization problems. We demonstrate the usefulness of the results by applying it on constrained multi-objective location problems. Using our new results we show that special classes of constrained multi-objective location problems (e.g., point-objective location problems, Weber location problems, center location problems) can be completely solved with the help of algorithms for the unconstrained case.
KW - Constrained optimization
KW - Gauges
KW - Generalized convexity
KW - Location theory
KW - Multi-objective optimization
KW - Pareto efficiency
KW - Unconstrained optimization
UR - http://www.scopus.com/inward/record.url?scp=84973151720&partnerID=8YFLogxK
U2 - 10.1007/s00186-016-0547-z
DO - 10.1007/s00186-016-0547-z
M3 - Article
VL - 84
SP - 359
EP - 387
JO - Mathematical Methods of Operations Research
JF - Mathematical Methods of Operations Research
SN - 1432-2994
IS - 2
ER -