On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems

DOI10.1137/S1052623496298534zbMath0917.65057OpenAlexW1980118447MaRDI QIDQ4229452

Elijah Polak, C. Kirjner-Neto

Publication date: 22 February 1999

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

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

zbMATH Keywords

numerical examplesnonlinear programmingdisjunctive optimizationpath-planningmax-min constraints

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items

Max–min separability, Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques, Solving linear optimization over arithmetic constraint formula, An aggregate deformation homotopy method for min-max-min problems with max-min constraints, Continuous minimax optimization using modal intervals, Sufficient optimality and sensitivity analysis of a parameterized min-max programming, Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints, Design of ODMA digital waveforms using non-convex optimization methods, On the conversion of optimization problems with max-min constraints to standard optimization problems, Preface