A nonconvex max-min problem

DOI10.1002/NAV.3800240307MaRDI QIDQ4158832zbMATH OpenOpenAlexFDO

Authors

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)

Cites work

• Strategic Weapons Exchange Models

Cited in

(12)

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

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

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