Continuous-time fractional minmax programming

DOI10.1016/J.MCM.2003.10.055MaRDI QIDQ815390zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Continuous-time generalized fractional programming
• Continuous-time multiobjective fractional programming
• Optimality conditions for fractional minmax programming
• Pseudolinear fractional minmax programming
• Continuous time linear-fractional programming. The minimum-risk approach
• On nondifferentiable fractional minimax programming
• Parametric continuous-time linear fractional programming problems
• On Minimax Fractional Semi-Infinite Programming Problems with Applications
• Minmax fractional programming problem involving generalized convex functions
• Optimality and duality in continuous-time nonlinear fractional programming

Cites work

• scientific article; zbMATH DE number 3918106 (Why is no real title available?)
• scientific article; zbMATH DE number 4055404 (Why is no real title available?)
• scientific article; zbMATH DE number 51950 (Why is no real title available?)
• scientific article; zbMATH DE number 798857 (Why is no real title available?)
• scientific article; zbMATH DE number 279301 (Why is no real title available?)
• scientific article; zbMATH DE number 3247810 (Why is no real title available?)
• A simple derivation of necessary conditions for static minmax problems
• Duality for a class of nondifferentiable mathematical programming problems
• Fractional Programming. I, Duality
• Necessary conditions and sufficient conditions for static minmax problems
• Necessary conditions for min-max problems and algorithms by a relaxation procedure
• Optimality conditions for a class of nondifferentiable minmax programming problems
• The Lagrange Multiplier Theorem for Max-Min with Several Constraints

Cited in

(8)

• Optimality conditions and duality for nonsmooth fractional continuous-time problems
• Optimality criteria and duality for nonlinear fractional continuous-time programming
• Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
• scientific article; zbMATH DE number 4104886 (Why is no real title available?)
• Optimality and duality in continuous-time nonlinear fractional programming
• 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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q815390)