Interval-valued vector optimization problems involving generalized approximate convexity

Volume 26, Issue 1, pp 67--79 http://dx.doi.org/10.22436/jmcs.026.01.06

Publication Date: October 14, 2021 Submission Date: July 19, 2021 Revision Date: August 17, 2021 Accteptance Date: August 23, 2021

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 892 Downloads
• 1779 Views

Authors

M. Jennane - FSDM, Department of Mathematics, Sidi Mohamed Ben Abdellah University, Fez, Morocco. E. M. Kalmoun - School of Science and Engineering, Al Akhawayn University in Ifrane, PO Box 104, Ifrane 53000, Morocco. L. E. Fadil - FSDM, Department of Mathematics, Sidi Mohamed Ben Abdellah University, Fez, Morocco.

Abstract

Interval-valued functions have been recently used to accommodate data inexactness in optimization and decision theory. In this paper, we consider the case of interval-valued vector optimization problems, and derive their relationships to interval variational inequality problems, of both Stampacchia and Minty types. Using the concept of interval approximate convexity, we establish necessary and sufficient optimality conditions for local strong quasi and approximate efficient solutions.

Share and Cite

Keywords

• Interval-valued vector optimization
• generalized approximate LU-e-convexity
• interval vector variational inequalities
• efficient solutions

MSC

•  49J53
•  90C33
•  49J40

References

• [1] Q. H. Ansari, E. Köbis, P. K. Sharma, Characterizations of multiobjective robustness via oriented distance function and image space analysis, J. Optim. Theory Appl., 181 (2019), 817--839
  • View Article
  • MathSciNet
  • Google Scholar


• [2] Q. H. Ansari, E. Köbis, J.-C. Yao, Vector variational inequalities and vector optimization, Springer, Cham (2018)
  • View Article
  • MathSciNet
  • Google Scholar


• [3] D. Bhatia, A. Gupta, P. Arora, Optimality via generalized approximate convexity and quasiefficiency, Optim. Lett., 7 (2013), 127--135
  • View Article
  • MathSciNet
  • Google Scholar


• [4] F. H. Clarke, Optimization and Nonsmooth Analysis, John Wiley & Sons, New York (1983)
  • View Article
  • MathSciNet
  • Google Scholar


• [5] A. Gupta, A. Mehra, D. Bhatia, Approximate convexity in vector optimization, Bull. Aust. Math. Soc., 74 (2006), 207--218
  • View Article
  • Google Scholar


• [6] P. Gupta, S. K. Mishra, On Minty variational principle for nonsmooth vector optimization problems with generalized approximate convexity, Optimization, 67 (2018), 1157--1167
  • View Article
  • MathSciNet
  • Google Scholar


• [7] M. Inuiguchi, Y. Kume, Goal programming problems with interval coefficients and target intervals, European J. Oper. Res., 52 (1991), 345--360
  • View Article
  • Google Scholar


• [8] M. Jennane, L. El Fadil, E. M. Kalmoun, On local quasi efficient solutions for nonsmooth vector optimization, Croat. Oper. Res. Rev. CRORR, 11 (2020), 1--10
  • View Article
  • MathSciNet
  • Google Scholar


• [9] C. Jiang, X. Han, G. R. Liu, G. P. Liu, A nonlinear interval number programming method for uncertain optimization problems, European J. Oper. Res., 188 (2008), 1--13
  • View Article
  • MathSciNet
  • Google Scholar


• [10] P. Kumar, B. Sharma, J. Dagar, Interval-valued programming problem with infinite constraints, J. Oper. Res. Soc. China, 6 (2018), 611--626
  • View Article
  • MathSciNet
  • Google Scholar


• [11] S. K. Mishra, V. Laha, On minty variational principle for nonsmooth vector optimization problems with approximate convexity, Optim. Lett., 10 (2016), 577--589
  • View Article
  • MathSciNet
  • Google Scholar


• [12] R. E. Moore, Interval Analysis, Prentice-Hall, Englewood Cliffs (1966)
  • View Article
  • MathSciNet
  • Google Scholar
  • MATH


• [13] R. E. Moore,, Method and Applications of Interval Analysis, SIAM, Philadelphia (1979)
  • View Article
  • MathSciNet
  • Google Scholar


• [14] H. V. Ngai, D. T. Luc, M. Thera, Approximate convex functions, J. Nonlinear Convex Anal., 1 (2000), 155--176
  • MathSciNet
  • Google Scholar


• [15] S. Rao, L. Berke, Analysis of uncertain structural systems using interval analysis, AIAA J., 34 (1997), 727--735
  • View Article
  • Google Scholar


• [16] H.-C. Wu, The Karush-Kuhn-Tucker optimality conditions in an optimization problem with interval-valued objective function, European J. Oper. Res., 176 (2007), 46--59
  • View Article
  • MathSciNet
  • Google Scholar


• [17] H.-C. Wu, The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective function, European J. Oper. Res., 196 (2009), 49--60
  • View Article
  • MathSciNet
  • Google Scholar


• [18] J. K. Zhang, S. Y. Liu, L. F. Li, Q. X. Feng, The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function, Optim. Lett., 8 (2014), 607--631
  • View Article
  • MathSciNet
  • Google Scholar


• [19] J. K. Zhang, Q. H. Zheng, X. J. Ma, L. F. Li, Relationships between interval-valued vector optimization problems and vector variational inequalities, Fuzzy Optim. Decis. Mak., 15 (2016), 33--55
  • View Article
  • MathSciNet
  • Google Scholar