A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
From MaRDI portal
(Redirected from Publication:691405)
Recommendations
- On higher-order converse duality for nondifferentiable multiobjective programming problems
- On higher-order duality in nondifferentiable minimax fractional programming
- scientific article; zbMATH DE number 7288685
- Higher-order duality for nondifferentiable minimax programming problem with generalized convexity
- Optimality conditions and higher-order duality for a nondifferentiable mathematical programming class
Cites work
- scientific article; zbMATH DE number 1328993 (Why is no real title available?)
- A class of nondifferentiable mathematical programming problems
- Generalized concavity and duality with a square root term
- Higher-order generalized convexity and duality in nondifferentiable multiobjective mathematical programming
- Higher-order generalized invexity and duality in nondifferentiable mathematical programming
- Higher-order symmetric duality in nondifferentiable multiobjective programming problems.
- Non-differentiable higher-order symmetric duality in mathematical programming with generalized invexity
- Non-differentiable second order symmetric duality in mathematical programming with \(F\)-convexity
- On second-order symmetric duality in nondifferentiable programming
- Second order symmetric duality in non-differentiable multiobjective programming with \(F\)-convexity
- Second- and higher-order duality in nonlinear programming
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
Cited in
(2)
This page was built for publication: A converse duality theorem on higher-order dual models in nondifferentiable mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q691405)
