Mathematical Sciences: A Generalized Lagrangian Duality Approach to Multiple Objective Programming

点击翻译按钮获取中文摘要

Generalized Lagrangian duality related to nonconvex multiple objective programming will provide new techniques for generating efficient solutions. Efficiency concept will be extended by incorporating the information about the location of solutions with respect to a duality about the location of solutions with respect to a duality gap. A complete characterization of the efficient set of the bicriteria problem will be included.