Efficiency and approachability of nonconvex bicriteria programs (Q5946936)

The paper presents some characterizations of efficient and proper efficient solutions of general bicriteria optimization problems via the concepts of modified lower envelopes and approachability [\textit{M. L. Tenhuisen} and \textit{M. M. Wiecek}, J. Glob. Optim. 11, 225-251 (1997; Zbl 0903.90147)]. By using two kinds of nonlinear Lagrangian functions, the authors construct dual problems and study the stability of the standard \(\varepsilon\)-constraint scalar optimization problems associated to the original bicriteria optimization problem.