Optimality Conditions for Nondifferentiable Minimax Programs and Vector Optimization Problems

First-order sufficient optimality conditions in terms of Lagrangian functions and Lagrange multipliers for nondifferentiable minimax programs and vector optimization problems in an Asplund space setting are obtained in this paper. Two illustrative examples are given. Our results implement the first-...

Full description

Saved in:
Bibliographic Details
Published in:Journal of optimization theory and applications Vol. 200; no. 2; pp. 703 - 723
Main Authors: Huyen, Duong Thi Kim, Kim, Do Sang, Yen, Nguyen Dong
Format: Journal Article
Language:English
Published: New York Springer US 01.02.2024
Springer Nature B.V
Subjects:
Applications of Mathematics
Applied mathematics
Approximation
Calculus of Variations and Optimal Control; Optimization
Engineering
Lagrange multiplier
Lagrangian function
Mathematical functions
Mathematical programming
Mathematics
Mathematics and Statistics
Minimax technique
Operations Research/Decision Theory
Optimality criteria
Optimization
Theory of Computation
Lower regular function
Limiting subdifferential
Sum rule
49J53
49J52
Nondifferentiable minimax program in an Asplund space
49J40
Optimality condition
26B25
Monotonicity
Vector optimization
ISSN:0022-3239, 1573-2878
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:First-order sufficient optimality conditions in terms of Lagrangian functions and Lagrange multipliers for nondifferentiable minimax programs and vector optimization problems in an Asplund space setting are obtained in this paper. Two illustrative examples are given. Our results implement the first-order necessary optimality conditions of Chuong and Kim (Ann Oper Res 251:73–87, 2017).
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0022-3239
1573-2878
DOI:10.1007/s10957-023-02366-2