SUFFICIENCY AND DUALITY FOR INTERVAL-VALUED OPTIMIZATION PROBLEMS WITH VANISHING CONSTRAINTS USING WEAK CONSTRAINT QUALIFICATIONS

Research output: Contribution to journalArticlepeer-review

Abstract

In this paper, we are concerned with one of the difficult class of optimization problems called the interval-valued optimization problem with vanishing constraints. Sufficient optimality conditions for a LU optimal solution are derived under generalized convexity assumptions. Moreover, appropriate duality results are discussed for a Mond-Weir type dual problem. In addition, numerical examples are given to support the sufficient optimality conditions and weak duality theorem.
Original languageEnglish
JournalETAMATHS PUBL
StatePublished - 2020

Fingerprint

Dive into the research topics of 'SUFFICIENCY AND DUALITY FOR INTERVAL-VALUED OPTIMIZATION PROBLEMS WITH VANISHING CONSTRAINTS USING WEAK CONSTRAINT QUALIFICATIONS'. Together they form a unique fingerprint.

Cite this