Journal of Applied Mathematics and Stochastic Analysis
Volume 2005 (2005), Issue 2, Pages 175-180
doi:10.1155/JAMSA.2005.175
Abstract
Under ρ−(η,θ)-invexity assumptions on the functions
involved, weak, strong, and converse duality theorems are proved to relate
properly efficient solutions of the primal and dual problems for a
multiobjective programming problem.