作者: C. Nahak
DOI: 10.1007/BF03008893
关键词: Mathematics 、 Duality (optimization) 、 Nonlinear programming 、 Discrete mathematics 、 Theory of computation 、 Converse 、 Dual (category theory) 、 Pure mathematics
摘要: A pair of multiobjective generalized symmetric dual nonlinear programming problems and weak, strong converse duality theorems for these are established under ρ − (η, θ)-invexity assumptions. Several known results obtained as special cases.