Answers are grounded in this paper and cite their sources.
We survey optimization problems that allow natural simple formulations with one existential and one universal quantifier. We summarize the theoretical background from computational complexity theory, and we present a multitude of illustrating examples. We discuss the connections to robust optimization and to bilevel optimization, and we explain the reasons why the operational research community should be interested in the theoretical aspects of this area.
No takes yet. Share an insight, caveat, or question.
Gerhard J. Woeginger (2021) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: