Connectedness of the efficient solution sets for a strictly path quasiconvex programming problem

Wantao, Fu; Kunping, Zhou

doi:10.1016/0362-546x(93)90115-9

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

1996

2011

Publication Types

Select...

Article3

Other1

Book1

Relationship

Self Cite0

Independent5

Authors

Journals

Cited by 9 publications

References 2 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Nonlinear Multiobjective Programming

Engau

2011

Wiley Encyclopedia of Operations Research and Management Science

View full text Add to dashboard Cite

This introductory treatment of the theory and methodology of nonlinear multiobjective programming offers an annotated bibliographic overview of various concepts and approaches to solve continuous deterministic multicriteria optimization problems. First, the notions of Pareto optimality, efficiency, and nondominance are discussed and then related to approximate, epsilon, and proper efficiency. Second, after highlighting similarities and pointing out differences to first‐ and second‐order optimality conditions in classical nonlinear programming, several other topics including duality and sensitivity are also mentioned. Third, a number of solution approaches and generating methods are described with a particular focus on scalarizations using objective aggregation, prioritization, and norm or distance minimization to some utopian reference point.

show abstract