Continuous-time fractional minmax programming
From MaRDI portal
Publication:815390
DOI10.1016/j.mcm.2003.10.055zbMath1089.90058MaRDI QIDQ815390
Publication date: 16 February 2006
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2003.10.055
optimality conditions; duality theorems; continuous-time fractional minmax programming; generalized convex functionals; Schaible type dual
90C47: Minimax problems in mathematical programming
90C46: Optimality conditions and duality in mathematical programming
90C32: Fractional programming
90C34: Semi-infinite programming
Related Items
Continuous-time generalized fractional programming problems. Part I: Basic theory, Using the parametric approach to solve the continuous-time linear fractional Max-min problems, An improved SQP algorithm for solving minimax problems, Optimality conditions and duality for nonsmooth fractional continuous-time problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simple derivation of necessary conditions for static minmax problems
- Duality for a class of nondifferentiable mathematical programming problems
- Necessary conditions and sufficient conditions for static minmax problems
- Optimality conditions for a class of nondifferentiable minmax programming problems
- Necessary conditions for min-max problems and algorithms by a relaxation procedure
- Fractional Programming. I, Duality
- The Lagrange Multiplier Theorem for Max-Min with Several Constraints