Higher order duality in multiobjective fractional programming problem with generalized convexity
From MaRDI portal
Recommendations
- Duality in nondifferentiable multiobjective fractional programming problem with generalized invexity
- Higher order duality in multiobjective fractional programming with support functions
- Higher-order symmetric duality for a class of multiobjective fractional programming problems
- Higher-order duality relations for multiobjective fractional problems involving support functions
- Sufficiency and duality in nondifferentiable multiobjective fractional programming with higher-order \((V, \alpha, \rho, \theta)\)-invexity
Cites work
- Convex Analysis
- Duality for a class of nondifferentiable multiobjective programming problems
- Generalized \((\eta,\rho)\)-invex functions and global semiparametric sufficient efficiency conditions for multiobjective fractional programming problems containing arbitrary norms
- Generalized hybrid \(B-(b, \rho, \theta, \tilde{p}, \tilde{r})\)-invexities and efficiency conditions for multiobjective fractional programming
- Higher Order Convexity and Duality in Multiobjective Programming Problems
- Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming
- Higher-order generalized invexity and duality in mathematical programming
- Higher-order generalized invexity and duality in nondifferentiable mathematical programming
- scientific article; zbMATH DE number 4012334 (Why is no real title available?)
- scientific article; zbMATH DE number 1328993 (Why is no real title available?)
- Invex functions and constrained local minima
- Invexity and optimization
- Necessary and sufficient conditions in constrained optimization
- Necessary conditions and sufficient conditions for static minmax problems
- Nondifferentiable higher order duality in multiobjective programming involving cones
- On \((p,r)\)-invexity-type nonlinear programming problems.
- On efficiency and duality for multiobjective programs
- On fractional programming containing support functions
- On sufficiency of the Kuhn-Tucker conditions
- Optimality criteria in mathematical programming involving generalized invexity
- Second order duality for fractional programming with support functions.
- Second- and higher-order duality in nonlinear programming
- Strong and Weak Convexity of Sets and Functions
Cited in
(11)- Higher-order duality for multiobjective programming problem involving \((\Phi, \rho)\)-invex functions
- Higher-order duality relations for multiobjective fractional problems involving support functions
- Duality in nondifferentiable multiobjective fractional programming problem with generalized invexity
- Higher order mixed type duality in nonsmooth multiobjective fractional programming involving generalized univex function
- Higher order duality for pseudolinear multiobjective fractional programming
- Higher order duality in multiobjective fractional programming with square root term under generalized higher order (F, , , , , d)-V-type I univex functions
- Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity
- HIGHER ORDER DUALITY FOR A NEW CLASS OF NONCONVEX SEMI-INFINITE MULTIOBJECTIVE FRACTIONAL PROGRAMMING WITH SUPPORT FUNCTIONS
- scientific article; zbMATH DE number 5240538 (Why is no real title available?)
- Parametric duality models for multiobjective fractional programming based on new generation hybrid invexities
- Sufficient conditions and duality for a class of multiobjective fractional programming problems with higher-order \((F,\alpha ,\rho,d)\)-convexity
This page was built for publication: Higher order duality in multiobjective fractional programming problem with generalized convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987694)
