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.