DocumentCode
120140
Title
An Analysis of Some Dual Problems for (0, Q) Invexity-Type Nonlinear Programming Problems
Author
Sanming Liu ; Zhijie Wang
Author_Institution
Dept. of Math. & Phys., Shanghai Dianji Univ., Shanghai, China
fYear
2014
fDate
4-6 July 2014
Firstpage
257
Lastpage
261
Abstract
In this paper, mathematical programming problems involving (0, Q) in vex functions with respect to eta are considered. Lagrange, Fenchel and Fenchel-Lagrange dual optimization problems are derived by means of distinct perturbations of the primal problem and studied. For the various dual problems, equality and inequality relations between the optimal values are verified under appropriate assumptions.
Keywords
nonlinear programming; (0,Q)-invex functions; (0,Q)-invexity-type nonlinear programming problems; Fenchel-Lagrange dual optimization problems; dual problems; equality relations; inequality relations; mathematical programming problems; Convex functions; Educational institutions; Electronic mail; Mathematical programming; Programming; Vectors; Conjugate duality; Invexity; Mathematical programming; Optimality conditions;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Sciences and Optimization (CSO), 2014 Seventh International Joint Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4799-5371-4
Type
conf
DOI
10.1109/CSO.2014.55
Filename
6923680
Link To Document