Generalized pseudo-convex minmax programming.
From MaRDI portal
Cites work
- A simple derivation of necessary conditions for static minmax problems
- Duality for a class of nondifferentiable mathematical programming problems
- Duality for fractional minimax programming problems
- scientific article; zbMATH DE number 3918106 (Why is no real title available?)
- scientific article; zbMATH DE number 222438 (Why is no real title available?)
- scientific article; zbMATH DE number 3052220 (Why is no real title available?)
- Necessary conditions and sufficient conditions for static minmax problems
- On generalised convex mathematical programming
- On sufficiency of the Kuhn-Tucker conditions
- Second order duality for a minimax programming problem
Cited in
(11)- A generalized semi-Pareto minification process
- On nondifferentiable minimax fractional programming under generalized -type I invexity
- Nondifferentiable minimax fractional programming under generalized univexity
- Generalized \(\alpha\)-invexity and nondifferentiable minimax fractional programming
- Generalized \(\alpha \)-univexity and duality for nondifferentiable minimax fractional programming
- scientific article; zbMATH DE number 5665898 (Why is no real title available?)
- Piecewise-convex maximization problems.
- Optimality conditions for nondifferentiable minimax programs and vector optimization problems
- Optimality and duality in nondifferentiable minimax programming problems involving \(\epsilon\)-quasi solutions
- (G, V)-invexity nondifferentiable generalized minimax fractional programming
- Second order duality for nondifferentiable minimax programming problems with generalized convexity
This page was built for publication: Generalized pseudo-convex minmax programming.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468567)
