The study higher-order Wolfe-type non-differentiable multiple objective symmetric duality involving generalized convex functions
From MaRDI portal
Publication:2068841
DOI10.1007/s43069-021-00090-zzbMath1490.90303OpenAlexW3213213346MaRDI QIDQ2068841
Publication date: 20 January 2022
Published in: SN Operations Research Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s43069-021-00090-z
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Convexity of real functions of several variables, generalizations (26B25)
Cites Work
- Unnamed Item
- Unnamed Item
- Duality for nondifferentiable multiobjective higher-order symmetric programs over cones involving generalized \((F,{\alpha},{\rho},d)\)-convexity
- Nondifferentiable higher order duality in multiobjective programming involving cones
- Wolfe type higher order multiple objective nondifferentiable symmetric dual programming with generalized invex function
- Higher order symmetric duality in nondifferentiable multi-objective programming problems involving generalized cone convex functions
- Higher-order \((F,\alpha ,\rho ,d)\)-convexity and symmetric duality in multiobjective programming
- Multiobjective higher-order symmetric duality involving generalized cone-invex functions
- Higher-order symmetric duality in multiobjective programming problems under higher-order invexity
- Higher-order nondifferentiable symmetric duality with generalized \(F\)-convexity
- Higher order duality in multiobjective fractional programming with support functions
- Higher-order symmetric duality in vector optimization problem involving generalized cone-invex functions
- Higher-order symmetric duality with cone constraints
- On sufficiency of the Kuhn-Tucker conditions
- On efficiency and duality for multiobjective programs
- Higher-order generalized invexity and duality in mathematical programming
- Multiobjective symmetric duality involving cones
- Higher-order duality for multiobjective programming problem involving \((\Phi, \rho)\)-invex functions
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity
- Invex functions and constrained local minima
- 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: The study higher-order Wolfe-type non-differentiable multiple objective symmetric duality involving generalized convex functions
