Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/27658
Title: Constructing efficient solutions structure of multiobjective linear programming
Authors: Yan, H 
Wei, Q
Wang, J
Keywords: Efficient solutions set
Multiobjective linear programming
Solution structure
Issue Date: 2005
Publisher: Academic Press
Source: Journal of mathematical analysis and applications, 2005, v. 307, no. 2, p. 504-523 How to cite?
Journal: Journal of mathematical analysis and applications 
Abstract: It is not a difficult task to find a weak Pareto or Pareto solution in a multiobjective linear programming (MOLP) problem. The difficulty lies in finding all these solutions and representing their structure. This paper develops an algorithm for solving this problem. We investigate the solutions and their relationships in the objective space. The algorithm determines finite number of weights, each of which corresponds to a weighted sum problems. By solving these problems, we further obtain all weak Pareto and Pareto solutions of the MOLP and their structure in the constraint space. The algorithm avoids the degeneration problem, which is a major hurdle of previous works, and presents an easy and clear solution structure.
URI: http://hdl.handle.net/10397/27658
ISSN: 0022-247X
EISSN: 1096-0813
DOI: 10.1016/j.jmaa.2004.08.069
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

15
Last Week
0
Last month
0
Citations as of Aug 15, 2017

WEB OF SCIENCETM
Citations

12
Last Week
0
Last month
0
Citations as of Aug 14, 2017

Page view(s)

46
Last Week
4
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.