Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1]
From MaRDI portal
Publication:5889943
DOI10.23952/jnva.7.2023.2.08OpenAlexW4384616566WikidataQ122261773 ScholiaQ122261773MaRDI QIDQ5889943
Gwi Soo Kim, Moon Hee Kim, Gue Myung Lee
Publication date: 28 April 2023
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.7.2023.2.08
optimal solutionsconstraint qualificationsintegral functionsoptimality theoremslinear fractional optimization problem
Cites Work
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Liberating the subgradient optimality conditions from constraint qualifications
- Advanced analysis on the real line
- A new geometric condition for Fenchel's duality in infinite dimensional spaces
- Strong Duality in Robust Convex Programming: Complete Characterizations
- On Extension of Fenchel Duality and its Application
- The SECQ, Linear Regularity, and the Strong CHIP for an Infinite System of Closed Convex Sets in Normed Linear Spaces
- New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
- Linear fractional optimization problems on Jordan Euclidean algebras
- ON OPTIMALITY CONDITIONS FOR ABSTRACT CONVEX VECTOR OPTIMIZATION PROBLEMS
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Optimality theorems for linear fractional optimization problems involving integral functions defined on Cn [0,1]