THE CHARACTERIZATION OF EFFICIENCY AND SADDLE POINT CRITERIA FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM WITH VANISHING CONSTRAINTS

doi:10.1007/s10473-019-0204-8

Acta mathematica scientia,Series B ›› 2019, Vol. 39 ›› Issue (2): 382-394.doi: 10.1007/s10473-019-0204-8

• Articles • Previous Articles Next Articles

THE CHARACTERIZATION OF EFFICIENCY AND SADDLE POINT CRITERIA FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM WITH VANISHING CONSTRAINTS

Anurag JAYSWAL, Vivek SINGH

Department of Applied Mathematics, Indian Institute of Technology(Indian School of Mines), Dhanbad 826 004, Jharkhand, India

Received:2018-03-29 Revised:2018-09-24 Online:2019-04-25 Published:2019-05-06
Contact: Vivek SINGH E-mail:viveksingh.25jun@gmail.com
Supported by:
The research of the first author was financially supported by the CSIR, New Delhi, India through Grant no.:25(0266)/17/EMR-Ⅱ.

Abstract

Abstract: In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.

Key words: multiobjective optimization problem with vanishing constraints, efficient solution, invexity, η-Lagrange function, saddle point

Anurag JAYSWAL, Vivek SINGH. THE CHARACTERIZATION OF EFFICIENCY AND SADDLE POINT CRITERIA FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM WITH VANISHING CONSTRAINTS[J].Acta mathematica scientia,Series B, 2019, 39(2): 382-394.

Trendmd

References

[1] Achtziger W, Kanzow C. Mathematical programs with vanishing constraints:optimality conditions and constraint qualifications. Math Prog, 2008, 114(1):69-99
[2] Antczak T. A new approach to multiobjective programming with a modified objective function. J Global Optim, 2003, 27(4):485-495
[3] Antczak T. An η-approximation method in nonlinear vector optimization. Nonlinear Anal, 2005, 63(2):225-236
[4] Facchinei F, Pang J S. Finite-Dimensional Variational Inequalities and Complementarity Problems. New York:Springer, 2003
[5] Hanson M A. On sufficiency of the Kuhn-Tucker conditions. J Math Anal Appl, 1981, 80(2):545-550
[6] Hoheisel T, Kanzow C. First and second-order optimality conditions for mathematical programs with vanishing constraints. Appl Math, 2007, 52(6):495-514
[7] Hoheisel T, Kanzow C. Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications. J Math Anal Appl, 2008, 337(1):292-310
[8] Hoheisel T, Kanzow C. On the Abadie and Guignard constraint qualification for mathematical programmes with vanishing constraints. Optimization, 2009, 58(4):431-448
[9] Luo Z Q, Pang J S, Ralph D. Mathematical Programs with Equilibrium Constraints. Cambridge:Cambridge University Press, 1996
[10] Mishra S K, Singh V, Laha V, Mohapatra R N. On Constraint qualifications for multiobjective optimization problems with vanishing constraints//Optimization Methods, Theory and Applications. Berlin, Heidelberg:Springer, 2015:95-135
[11] Outrarata J V, Kocvara M, Zowe J. Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Dordrecht:Kluwer Academic Publishers, 1998
[12] Pareto V. Cours de Economie Politique. Switzerland:Rouge, Lausanne, 1896
[13] Tanino T, Sawaragi Y. Duality theory in multiobjective programming. J Optim Theory Appl, 1979, 27(4):509-529

THE CHARACTERIZATION OF EFFICIENCY AND SADDLE POINT CRITERIA FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM WITH VANISHING CONSTRAINTS

PDF (PC)

Abstract

Cite this article

share this article

References

Related Articles 8

Metrics

Comments

Recommended 0

[1]	Tadeusz ANTCZAK. OPTIMALITY CONDITIONS AND DUALITY RESULTS FOR NONSMOOTH VECTOR OPTIMIZATION PROBLEMS WITH THE MULTIPLE INTERVAL-VALUED OBJECTIVE FUNCTION [J]. Acta mathematica scientia,Series B, 2017, 37(4): 1133-1150.
[2]	Adela CAPǍTǍ. EXISTENCE RESULTS FOR GLOBALLY EFFICIENT SOLUTIONS OF VECTOR EQUILIBRIUM PROBLEMS VIA A GENERALIZED KKM PRINCIPLE [J]. Acta mathematica scientia,Series B, 2017, 37(2): 463-476.
[3]	Ram U. VERMA. THE SUFFICIENT EFFICIENCY CONDITIONS IN SEMIINFINITE MULTIOBJECTIVE FRACTIONAL PROGRAMMING UNDER HIGHER ORDER EXPONENTIAL TYPE HYBRID TYPE INVEXITIES [J]. Acta mathematica scientia,Series B, 2015, 35(6): 1437-1453.
[4]	GONG Xun-Hua. EKELAND´S PRINCIPLE FOR SET-VALUED VECTOR EQUILIBRIUM PROBLEMS [J]. Acta mathematica scientia,Series B, 2014, 34(4): 1179-1192.
[5]	Tarek Emam. METHOD OF CENTERS ALGORITHM FOR MULTI-OBJECTIVE PROGRAMMING PROBLEMS [J]. Acta mathematica scientia,Series B, 2009, 29(5): 1128-1142.
[6]	E. A. Youness; Tarek Emam. CHARACTERIZATION OF EFFICIENT SOLUTIONS FOR MULTI-OBJECTIVE OPTIMIZATION PROBLEMS INVOLVING SEMI-STRONG AND GENERALIZED SEMI-STRONG E-CONVEXITY [J]. Acta mathematica scientia,Series B, 2008, 28(1): 7-16.
[7]	XI Fu-Bao, DIAO Li-Qin. WEAK LIMITS OF EMPIRICAL MEASURES FOR A FAMILY OF DIFFUSION PROCESSES [J]. Acta mathematica scientia,Series B, 2004, 24(2): 301-306.
[8]	LIU Xian-Zhong, HU Shi-Geng, LIU Jin-Shan. MINIMAX THEOREMS FOR SUBCONVEXLIKE FUNCTIONS WITH APPLICATIONS TO SADDLE POINT PROBLEMS [J]. Acta mathematica scientia,Series B, 2002, 22(1): 115-122.