scientific article; zbMATH DE number 7708732
From MaRDI portal
Publication:6167145
DOI10.3770/j.issn:2095-2651.2023.03.005zbMath1524.90310MaRDI QIDQ6167145
No author found.
Publication date: 7 July 2023
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
optimality conditionsdualityfractional programming\(E\)-convexityhigher-order \((F, \alpha, \beta, \rho, d, E)\)-convexity
Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32)
Cites Work
- Unnamed Item
- Unnamed Item
- A combined interactive approach for solving E-convex multiobjective nonlinear programming problem
- Some properties of \(E\)-convex functions
- On sufficiency of the Kuhn-Tucker conditions
- Duality for multiobjective fractional programming involving generalized \(\eta\)-bonvex functions
- On efficiency and duality for multiobjective programs
- \(E\)-convex sets, \(E\)-convex functions, and \(E\)-convex programming
- Characterization of efficient solutions of multi-objective \(E\)-convex programming problems
- Some properties of semi-\(E\)-convex functions.
- Optimality criteria in \(E\)-convex programming
- On geodesic \(E\)-convex sets, geodesic \(E\)-convex functions and \(E\)-epigraphs
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- Second order \((F, \alpha , \rho , d)\)-convexity and duality in multiobjective programming
- Optimality conditions of \(E\)-convex programming for an \(E\)-differentiable function
- Strong and Weak Convexity of Sets and Functions
- Further Generalizations of Convexity in Mathematical Programming
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication:
