中文

Operations Research Transactions >

2023 , Vol. 27 >Issue 1: 87 - 102

DOI: https://doi.org/10.15960/j.cnki.issn.1007-6093.2023.01.006

Optimality conditions and duality theorems for interval-valued optimization problems with vanishing constraints

Expand
  • 1. Department of Mathematics, Taiyuan Normal University, Jinzhong 030619, Shanxi, China

Received date: 2021-02-07

  Online published: 2023-03-16

Fold

Abstract

In this paper, a class of nonsmooth interval-valued optimization problem with vanishing constraints (IOPVC) is considered. The necessary and sufficient optimality conditions for LU optimal solution of (IOPVC) are obtained under some constraint qualifications. The weak duality, strong duality and strict converse duality theorems between (IOPVC) and the corresponding Mond-Weir type and Wolfe type dual models are studied. Furthermore, some examples are given to illustrate our results.

Key words： locally Lipschitz function; optimality conditions; interval-valued optimization problems; vanishing constraints; duality theorems

Cite this article

Haijun WANG, Huihui WANG . Optimality conditions and duality theorems for interval-valued optimization problems with vanishing constraints[J]. Operations Research Transactions, 2023 , 27(1) : 87 -102 . DOI: 10.15960/j.cnki.issn.1007-6093.2023.01.006

References

1 苏秋红, 董增川. 区间优化方法在水库调度中的应用[J]. 河海大学学报(自然科学版), 2004, 32 (4): 384- 386.
2 Wu H C . The Karush-Kuhn-Tucker optimality conditions in an optimization problem with interval valued objective function[J]. European Journal of Operational Research, 2007, 176, 46- 59.
3 Sun Y , Wang L . Optimality conditions and duality in nondifferentiable interval-valued programming[J]. Journal of Industrial and Management Optimization, 2013, 9, 131- 142.
4 Wang H J , Zhang R F . Optimality conditions and duality for arcwise connected interval optimization problems[J]. Opsearch, 2015, 52, 870- 883.
5 Tung L T . Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions[J]. Journal of Applied Mathematics and Computing, 2020, 62, 67- 91.
6 Su T V, Dinh D H. Duality results for interval-valued pseudoconvex optimization problem with equilibrium constraints with applications[J]. Computational and Applied Mathematics, 2020, 39(2): article 127.
7 Kummari K , Ahmad I . Sufficient optimality conditions and duality for nonsmooth interval-valued optimization problems via L-invex-infine functions[J]. University Politehnica of Bucharest Scientific Bulletin, Series A, 2020, 82 (1): 45- 54.
8 Achtziger W , Kanzow C . Mathematical programs with vanishing constraints: optimality conditions and constraint qualifications[J]. Mathematical Programming, 2008, 114 (1): 69- 99.
9 Hoheisel T , Kanzow C . Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications[J]. Journal of Mathematical Analysis and Applications, 2008, 337 (1): 292- 310.
10 Guu S M , Singh Y , Mishra S K . On strong KKT type sufficient optimality conditions for multiobjective semi-infinite programming problems with vanishing constraints[J]. Journal of Inequalities and Applications, 2017, 282, 1- 9.
11 Tung L T . Karush-Kuhn-Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints[J]. Numerical Functional Analysis and Optimization, 2019, 41 (6): 1- 26.
12 Ahmad I , Kummari K , Al-Homidan S . Sufficiency and duality for interval-valued optimization problems with vanishing constraints using weak constraint qualifications[J]. International Journal of Analysis and Applications, 2020, 18, 784- 798.
13 Hu Q J , Dong R G , Zhang H Q . Lagrange type duality and saddle point optimality criteria for mathematical programs with vanishing constraints[J]. Mathematica Applicata, 2019, 32 (3): 608- 618.
14 Dong Y F , Chu D J , Hu L Y , et al. A partly smoothing-regularization method for mathematical programs with vanishing constraints[J]. Mathematica Applicata, 2021, 34 (1): 163- 175.
15 Clarke F H . Optimization and Nonsmooth Analysis[M]. New York: Wiley, 1983.
16 Moore R E . Methods and Applications of Interval Analysis[M]. Philadelphia: SIAM, 1979.
17 Rockafellar R T . Convex Analysis[M]. Princeton: Princeton University Press, 1970.
18 Goberna M A , Lopéz M A . Linear Semi-Infinite Optimization[M]. Chichester: Wiley, 1998.
19 Hiriart-Urruty J B , Lemaréchal C . Convex Analysis and Minimization Algorithms Ⅰ[M]. Berlin: Springer, 1993.
Options
Outlines

/

〈 〉