A nonconvex max-min problem
From MaRDI portal
Publication:4158832
DOI10.1002/nav.3800240307zbMath0379.90091MaRDI QIDQ4158832
No author found.
Publication date: 1977
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800240307
90C30: Nonlinear programming
Related Items
Recent advances in nonconvex semi-infinite programming: applications and algorithms, Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development, Global optimization of generalized semi-infinite programs via restriction of the right hand side, A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs, Towards global bilevel dynamic optimization, Global solution of bilevel programs with a nonconvex inner program, Optimal deterministic algorithm generation, Global solution of nonlinear mixed-integer bilevel programs, Global solution of semi-infinite programs with existence constraints, Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables, New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm, Bilevel linear programming
Cites Work
