On characterizations of solution sets of interval-valued quasiconvex programming problems
From MaRDI portal
Publication:6181225
DOI10.1051/ro/2023124OpenAlexW4386415270MaRDI QIDQ6181225
No author found.
Publication date: 22 January 2024
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1051/ro/2023124
Optimality conditions and duality in mathematical programming (90C46) General methods in interval analysis (65G40) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Unnamed Item
- Some continuity notions for interval functions and representation
- Calculus for interval-valued functions using generalized Hukuhara derivative and applications
- Generalized Hukuhara differentiability of interval-valued functions and interval differential equations
- A simple characterization of solutions sets of convex programs
- Characterization of solution sets of quasiconvex programs
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
- On characterizing the solution sets of pseudolinear programs
- On semidifferentiable interval-valued programming problems
- Hermite-Hadamard-type inequalities for interval-valued preinvex functions via Riemann-Liouville fractional integrals
- Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential
- The Karush-Kuhn-Tucker optimality conditions in multiobjective programming problems with interval-valued objective functions
- Characterizations of solution sets of differentiable quasiconvex programming problems
- The Karush--Kuhn--Tucker optimality conditions in an optimization problem with interval-valued objective function
- Characterizations of pseudoconvex functions and semistrictly quasiconvex ones
- The KKT optimality conditions in a class of generalized convex optimization problems with an interval-valued objective function
- On interval-valued nonlinear programming problems
- Characterizations of solution sets of convex vector minimization problems
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A differential calculus for multifunctions
- Characterization of solution sets of convex programs
- Introduction to Numerical Analysis
- Linear interval inequalities
- Second-order optimality conditions and Lagrange multiplier characterizations of the solution set in quasiconvex programming
- Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators
This page was built for publication: On characterizations of solution sets of interval-valued quasiconvex programming problems