Saddle Point Criteria in Nonsmooth Semi-Infinite Minimax Fractional Programming Problems

This paper considers a nonsmooth semi-infinite minimax fractional programming problem (SIMFP) involving locally Lipschitz invex functions. The authors establish necessary optimality conditions for SIMFP. The authors establish the relationship between an optimal solution of SIMFP and saddle point of...

Full description

Saved in:
Bibliographic Details
Published inJournal of systems science and complexity Vol. 31; no. 2; pp. 446 - 462
Main Authors Mishra, S. K., Singh, Yadvendra, Verma, R. U.
Format Journal Article
LanguageEnglish
Published Beijing Academy of Mathematics and Systems Science, Chinese Academy of Sciences 01.04.2018
Springer Nature B.V
Subjects
Complex Systems
Control
Mathematical programming
Mathematics
Mathematics and Statistics
Mathematics of Computing
Minimax technique
Operations Research/Decision Theory
Optimization
Saddle points
Statistics
Systems Theory
saddle point
nonsmooth programming problems
semi-infinite minimax fractional programming problems
Generalized convexity
Lagrange function
Online AccessGet full text

Cover

More Information
Summary:This paper considers a nonsmooth semi-infinite minimax fractional programming problem (SIMFP) involving locally Lipschitz invex functions. The authors establish necessary optimality conditions for SIMFP. The authors establish the relationship between an optimal solution of SIMFP and saddle point of scalar Lagrange function for SIMFP. Further, the authors study saddle point criteria of a vector Lagrange function defined for SIMFP.
ISSN:1009-6124
1559-7067
DOI:10.1007/s11424-017-6085-9