scientific article; zbMATH DE number 7288685
From MaRDI portal
Publication:5141699
Recommendations
- On higher-order duality in nondifferentiable minimax fractional programming
- Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity
- Higher order duality in nondifferentiable fractional programming involving generalized convexity
- Duality for nondifferentiable minimax fractional programming problem involving higher order \((C,\alpha, \rho, d)\)-convexity
- On nondifferentiable minimax fractional programming involving higher order generalized convexity
- Duality on a nondifferentiable minimax fractional programming
- On duality theorems for a nondifferentiable minimax fractional programming
- Second-order duality for non-differentiable minimax fractional programming
- On second-order duality for nondifferentiable minimax fractional programming
- Higher-order non-symmetric duality for nondifferentiable minimax fractional programs with square root terms
Cites work
- Duality in nondifferentiable minimax fractional programming with generalized convexity
- Further Generalizations of Convexity in Mathematical Programming
- Global parametric sufficient optimality conditions for semi-infinite discrete minmax fractional programming problems involving generalized \((\eta ,\rho )\)-invex functions
- Higher order symmetric multiobjective duality involving generalized (F, , , b)-convexity
- Higher-order \((\Phi,\rho)\)-\(V\)-invexity and duality for vector optimization problems
- Higher-order duality for multiobjective programming problems involving \({(F, \alpha, \rho, d)}\)-V-type I functions
- Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity
- Higher-order symmetric duality for a class of multiobjective fractional programming problems
- Higher-order symmetric duality in multiobjective programming problems
- scientific article; zbMATH DE number 5240538 (Why is no real title available?)
- Necessary and sufficient conditions for minimax fractional programming
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- On duality theorems for a nondifferentiable minimax fractional programming
- On efficiency and duality for multiobjective programs
- On nondifferentiable minimax fractional programming involving generalized (C,,,d)-convexity
- On second order duality of minimax fractional programming with square root term involving generalized \(B\)-\((p,r)\)-invex functions
- On second-order duality for a class of nondifferentiable minimax fractional programming problem with \((C,\alpha,\rho,d)\)-convexity
- On second-order duality for nondifferentiable minimax fractional programming
- Optimality and duality for a class of nondifferentiable minimax fractional programming problems
- Optimality and duality for nondifferentiable minimax fractional programming with generalized convexity
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
- Second-order duality for a nondifferentiable minimax fractional programming under generalized \(\alpha\)-univexity
- Second-order duality in nondifferentiable minmax programming involving type-I functions
- Strong and Weak Convexity of Sets and Functions
Cited in
(9)- Duality for nondifferentiable minimax fractional programming problem involving higher order \((C,\alpha, \rho, d)\)-convexity
- Higher-order non-symmetric duality for nondifferentiable minimax fractional programs with square root terms
- Non-differentiable minimax fractional programming with higher-order type I functions
- Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity
- Higher-order duality in nondifferentiable minimax fractional programming involving generalized convexity
- On higher-order duality in nondifferentiable minimax fractional programming
- On nondifferentiable minimax fractional programming involving higher order generalized convexity
- Higher-order duality for nondifferentiable minimax programming problem with generalized convexity
- A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5141699)