Duality without a constraint qualification for minimax fractional programming
From MaRDI portal
Publication:1293955
DOI10.1023/A:1021771011210zbMATH Open0945.90078MaRDI QIDQ1293955FDOQ1293955
Authors: Hang-Chin Lai, Jen-chwan Liu, Kensuke Tanaka 
Publication date: 29 June 1999
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
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
- Optimality and duality for generalized fractional variational problems involving generalized (fρ)-convex functions
- An algorithm for generalized fractional programs
- Generalized fractional programming duablity: a ratio game approach
- Optimality and duality for generalized fractional programming involving nonsmooth pseudoindex functions
- Title not available (Why is that?)
- Parametric approaches to fractional programs
- Title not available (Why is that?)
- Duality for minmax programming involvingV-invex functions
- Duality in generalized linear fractional programming
- Title not available (Why is that?)
- Moreau-Rockafellar type theorem for convex set functions
- Generalized fractional programming duality: A parametric approach
- Title not available (Why is that?)
- Optimality conditions and duality models for generalized fractional programming problems containing locally subdifferentiable and ρ:-convex functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimality and duality for generalized fractional programming involving nonsmooth \((F,\rho)\)-convex functions
- Duality without constraint qualification for multiobjective programming
- Title not available (Why is that?)
Cited In (14)
- Mixed duality without a constraint qualification for minimax fractional programming
- Complex fractional programming and the Charnes-Cooper transformation
- Minimax fractional programming for \(n\)-set functions and mixed-type duality under generalized Invexity
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Duality for a minimax programming problem containing \(n\)-set functions
- On a dynamic fractional game
- Three types dual model for minimax fractional programming
- Mixed Duality without Constraint Qualification for Nonsmooth Fractional Programming
- On minimax fractional programming of generalized convex set functions
- A sixth bibliography of fractional programming
- Optimality and duality without a constraint qualification for minimax programming
- On duality theorems for a nondifferentiable minimax fractional programming
- Parameter-free dual models for fractional programming with generalized invexity
- Minimax fractional programming involving generalised invex functions
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)
