Solving multistage quantified linear optimization problems with the alpha–beta nested Benders decomposition
Quantified linear programs (QLPs) are linear programs with variables being either existentially or universally quantified. QLPs are convex multistage decision problems on the one side, and two-person zero-sum games between an existential and a universal player on the other side. Solutions of feasibl...
Enregistré dans:
Auteurs principaux: | , |
---|---|
Format: | article |
Langue: | EN |
Publié: |
Elsevier
2015
|
Sujets: | |
Accès en ligne: | https://doaj.org/article/5b08a36d74fd4e89b12c632614eefe02 |
Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|