Robust Necessary Optimality Conditions for Nondifferentiable Complex Fractional Programming with Uncertain Data

Research output: Contribution to journalArticlepeer-review

15 Scopus citations

Abstract

In this paper, we study robust necessary optimality conditions for a nondifferentiable complex fractional programming with uncertain data. A robust counterpart of uncertain complex fractional programming is introduced in the worst-case scenario. The concept of robust optimal solution of the uncertain complex fractional programming is introduced by using robust counterpart. We give an equivalence between the optimal solutions of the robust counterpart and a minimax nonfractional parametric programming. Finally, Fritz John-type and Karush–Kuhn–Tucker-type robust necessary optimality conditions of the uncertain complex fractional programming are established under some suitable conditions.

Original languageEnglish
Pages (from-to)221-243
Number of pages23
JournalJournal of Optimization Theory and Applications
Volume189
Issue number1
DOIs
StatePublished - Apr 2021

Bibliographical note

Publisher Copyright:
© 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature.

Keywords

  • Robust constraint qualification
  • Robust counterpart
  • Robust necessary optimality conditions
  • Uncertain complex fractional programming

ASJC Scopus subject areas

  • Control and Optimization
  • Management Science and Operations Research
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Robust Necessary Optimality Conditions for Nondifferentiable Complex Fractional Programming with Uncertain Data'. Together they form a unique fingerprint.

Cite this