Duality without a constraint qualification for minimax fractional programming
From MaRDI portal
Publication:1293955
Recommendations
- Mixed duality without a constraint qualification for minimax fractional programming
- Optimality and duality without a constraint qualification for minimax programming
- Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
- Necessary and sufficient conditions for minimax fractional programming
Cites work
- scientific article; zbMATH DE number 4179152 (Why is no real title available?)
- scientific article; zbMATH DE number 3934789 (Why is no real title available?)
- scientific article; zbMATH DE number 3711742 (Why is no real title available?)
- scientific article; zbMATH DE number 12754 (Why is no real title available?)
- scientific article; zbMATH DE number 3625127 (Why is no real title available?)
- scientific article; zbMATH DE number 3441084 (Why is no real title available?)
- scientific article; zbMATH DE number 4193476 (Why is no real title available?)
- An algorithm for generalized fractional programs
- Duality for minmax programming involvingV-invex functions
- Duality in generalized linear fractional programming
- Duality without constraint qualification for multiobjective programming
- Generalized fractional programming duablity: a ratio game approach
- Generalized fractional programming duality: A parametric approach
- Moreau-Rockafellar type theorem for convex set functions
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Parametric approaches to fractional programs
Cited in
(14)- A sixth bibliography of fractional programming
- On minimax fractional programming of generalized convex set functions
- Optimality and duality without a constraint qualification for minimax programming
- Three types dual model for minimax fractional programming
- Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
- Parameter-free dual models for fractional programming with generalized invexity
- Mixed duality without a constraint qualification for minimax fractional programming
- Minimax fractional programming involving generalised invex functions
- Complex fractional programming and the Charnes-Cooper transformation
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Duality for a minimax programming problem containing \(n\)-set functions
- On duality theorems for a nondifferentiable minimax fractional programming
- Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity
- On a dynamic fractional game
This page was built for publication: Duality without a constraint qualification for minimax fractional programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293955)