A combined scalarizing method for multiobjective programming problems

Narges Rastegar and Esmaile Khorram

European Journal of Operational Research, 2014, vol. 236, issue 1, 229-237

Abstract: In this paper, a new general scalarization technique for solving multiobjective optimization problems is presented. After studying the properties of this formulation, two problems as special cases of this general formula are considered. It is shown that some well-known methods such as the weighted sum method, the ∊-constraint method, the Benson method, the hybrid method and the elastic ∊-constraint method can be subsumed under these two problems. Then, considering approximate solutions, some relationships between ε-(weakly, properly) efficient points of a general (without any convexity assumption) multiobjective optimization problem and ∊-optimal solutions of the introduced scalarized problem are achieved.

Keywords: Multiple objective programming; Scalarization method; Approximate solutions; Properly efficient solutions; ε-Properly efficient solutions (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221713009375
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:ejores:v:236:y:2014:i:1:p:229-237

DOI: 10.1016/j.ejor.2013.11.020

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().