Efficiency and approachability of nonconvex bicriteria programs

X. X. Huang, Xiaoqi Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

1 Citation (Scopus)


In this paper we investigate equivalences between an efficient solution of a bicriteria program and a lower envelope point of a certain image set of the bicriteria program. We also employ various kinds of approachabilities to characterize efficiency and proper efficiency for nonconvex bicriteria programs. In particular, nonlinear Lagranian functions are applied to construct dual problems and to study stability for the corresponding constrained scalar optimization problems. Under certain conditions we show that the finite approachability, proper efficiency, stability, and exact penalization of the relevant constrained scalar optimization problems are equivalent.
Original languageEnglish
Pages (from-to)134-150
Number of pages17
JournalJournal of Mathematical Analysis and Applications
Issue number1
Publication statusPublished - 1 Sept 2001


  • Approachability
  • Bicriteria program
  • Efficiency
  • Exact penalization
  • Nonlinear Lagrangian
  • Stability

ASJC Scopus subject areas

  • Analysis
  • Applied Mathematics


Dive into the research topics of 'Efficiency and approachability of nonconvex bicriteria programs'. Together they form a unique fingerprint.

Cite this