Counterexample-guided abstraction refinement for linear programs with arrays.
Alessandro ArmandoMassimo BenerecettiJacopo MantovaniPublished in: Autom. Softw. Eng. (2014)
Keyphrases
- linear program
- linear programming
- semi infinite
- simplex method
- optimal solution
- primal dual
- objective function
- np hard
- mixed integer
- stochastic programming
- model checking
- high level
- interior point methods
- column generation
- nelder mead
- linear programming problems
- dynamic programming
- multistage stochastic
- mixed integer linear program
- integer program
- interior point
- formal verification
- extreme points
- branch and bound algorithm
- search algorithm
- cutting plane
- convex functions
- quadratic program
- simplex algorithm
- linear inequalities
- mathematical model
- lower bound
- inventory routing