A nonconvex max-min problem

DOI10.1002/nav.3800240307zbMath0379.90091OpenAlexW2110235788MaRDI 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

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (12)

Bilevel linear programming ⋮ Towards global bilevel dynamic optimization ⋮ Adaptive discretization-based algorithms for semi-infinite programs with unbounded variables ⋮ Optimal deterministic algorithm generation ⋮ New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm ⋮ Recent advances in nonconvex semi-infinite programming: applications and algorithms ⋮ Global solution of nonlinear mixed-integer bilevel programs ⋮ 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 ⋮ Global solution of semi-infinite programs with existence constraints ⋮ Global solution of bilevel programs with a nonconvex inner program

Cites Work

• Strategic Weapons Exchange Models

This page was built for publication: A nonconvex max-min problem