The Lagrange Multiplier Theorem for Max-Min with Several Constraints

DOI10.1137/0114054zbMath0144.42803OpenAlexW2027228946MaRDI QIDQ5521245

Joseph Bram

Publication date: 1966

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0114054

zbMATH Keywords

operations research

Related Items (17)

Nondifferentiable minimax programming problems with applications ⋮ A simple derivation of necessary conditions for static minmax problems ⋮ Set-valued minimax programming problems under generalized cone convexity ⋮ Theoretical aspects of optimal autocorrelation synthesis ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Nonsmooth semi-infinite minmax programming involving generalized \((\varPhi,\rho)\)-invexity ⋮ Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity ⋮ Necessary conditions and sufficient conditions for static minmax problems ⋮ Worst-case estimation for econometric models with unobservable components ⋮ Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions ⋮ An algorithm for minimax parameter optimization ⋮ On Minimax Fractional Semi-Infinite Programming Problems with Applications ⋮ Minimax programming as a tool for studying robust multi-objective optimization problems ⋮ Extension of optimality conditions via supporting functions ⋮ On semi-infinite minmax programming with generalized invexity ⋮ Continuous-time fractional minmax programming

This page was built for publication: The Lagrange Multiplier Theorem for Max-Min with Several Constraints