Continuous-time fractional minmax programming

DOI10.1016/j.mcm.2003.10.055zbMath1089.90058OpenAlexW2076840899MaRDI QIDQ815390

N. E. Zubov

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

zbMATH Keywords

optimality conditionsduality theoremscontinuous-time fractional minmax programminggeneralized convex functionalsSchaible type dual

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Optimality conditions and duality in mathematical programming (90C46) Fractional programming (90C32) Semi-infinite programming (90C34)

Related Items (5)

Continuous-time generalized fractional programming problems. Part I: Basic theory ⋮ Optimality conditions and duality for nonsmooth fractional continuous-time problems ⋮ Using the parametric approach to solve the continuous-time linear fractional Max-min problems ⋮ Unnamed Item ⋮ An improved SQP algorithm for solving minimax problems

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Continuous-time fractional minmax programming