On parametric representations of the efficient set of multiple objective mathematical programming problems

Expand
  • 1. Senior Energy Market Specialist,  Southern California Edison,  Rosemead,  CA 91770, USA

Received date: 2015-04-24

  Online published: 2015-09-15

Abstract

In this paper we present some new results that characterize the efficient solutions of a p-dimensional multiple objective mathematical programming (MOMP). These characterizations are in terms of the optimal solutions of appropriate scalar optimization problems or in terms of efficient solutions of appropriate (p-1)-dimensional parametric MOMP.

Cite this article

SUN Erjiang . On parametric representations of the efficient set of multiple objective mathematical programming problems[J]. Operations Research Transactions, 2015 , 19(3) : 42 -47 . DOI: 10.15960/j.cnki.issn.1007-6093.2015.03.006

References

Kuhn H W, Tucker A W. Nonlinear Programming [C]// Proceedings of the Second Berkeley Symposium on Mathematical Statistics and Probability, Berkeley, California, 1951, 481-492.


Haimes Y Y, Lasdon L S, Wismer D A. On a bicriterion formulation of the problems of integrated system identification and system optimization [J].  IEEE Transactions on Systems, Man, and Cybernetics, 1971, SMC-1: 296-297.

Chankong V, Haimes Y Y.  Multiobjective Decision Making  : Theory and Methodology [M].  New York: Elsevier Science Publishing, 1983.

Sun E J. New Closedness Results and Algorithms for Finding Efficient Sets in Multiple Objective Mathematical Programming [D]. University of Florida, 2000.

Sun E J. On the connectedness of the efficient set for strictly quasiconvex vector minimization problems [J].  Journal of Optimization Theory and Applications, 1996,  89: 475-481.

 
Outlines

/