On various duality theorems in nonsmooth generalized convex programming

0.00 Avg rating—0 Votes

Article ID:	iaor20003726
Country:	Singapore
Volume:	16
Issue:	1
Start Page Number:	113
End Page Number:	124
Publication Date:	May 1999
Journal:	Asia-Pacific Journal of Operational Research
Authors:	Zeng Renying
Keywords:	duality, invexity

Abstract:

In this paper we use the concepts of (F, ρ)-invexity, (F, ρ)-quasiinvexity and (F, ρ)-pseudoinvexity to discuss the generalized convex programming: (OP) {min f(x) s.t. gi(x) ≤ 0 (i = 1, …, m), hj(x) = 0 (j = 1, …, n), x ∈ X and obtain various duality theorems. Where X is a Banach space f, gi (i = 1, …, m) and hj (j = 1, …, n) are functions from X to R¹.

Reviews

Required fields are marked *. Your email address will not be published.