Robust Sufficient Optimality Conditions And Duality In Semi-Infinite Multiobjective Programming With Data Uncertainty

I. Ahmad, A. Kaur, M. K. Sharma

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

A semi-infinite multiobjective programming problem in the face of data uncertainty in constraints is considered. Robust sufficient optimality conditions for weakly robust efficient, robust efficient and properly robust efficient solutions to the problem are established. Mond-Weir type dual model is formulated and appropriate duality results are obtained. The results are illustrated with a biobjective uncertainty semi-infinite problem.

Original languageEnglish
Pages (from-to)87-99
Number of pages13
JournalActa Mathematica Universitatis Comenianae
Volume91
Issue number1
StatePublished - 1 Feb 2022

Bibliographical note

Funding Information:
Received March 13, 2021; revised December 15, 2021. 2020 Mathematics Subject Classification. Primary 90C26, 90C29, 90C34, 90C46. Key words and phrases. Semi-infinite programming; multiobjective programming; robust optimization; optimality conditions; duality theorems. The first author gratefully acknowledges the King Fahd University of Petroleum and Minerals, Saudi Arabia to provide the financial support under the Small/Sabic Research Grant no. SB191005.

Publisher Copyright:
© 2022, Comenius University in Bratislava. All rights reserved.

Keywords

  • Duality theorems
  • Multiobjective programming
  • Optimality conditions
  • Robust optimization
  • Semi-infinite programming

ASJC Scopus subject areas

  • Mathematics (all)

Fingerprint

Dive into the research topics of 'Robust Sufficient Optimality Conditions And Duality In Semi-Infinite Multiobjective Programming With Data Uncertainty'. Together they form a unique fingerprint.

Cite this