Quickly Finding Recursively Feasible Solutions for MPC with Discrete Variables.
Liren YangAmey KatnikNecmiye OzayPublished in: CCTA (2019)
Keyphrases
- feasible solution
- discrete variables
- mixed integer
- linear programming
- tabu search
- objective function
- optimal solution
- continuous variables
- lagrangian relaxation
- convex hull
- valid inequalities
- linear program
- mathematical model
- mixed integer programming
- linear programming relaxation
- convex optimization
- markov networks
- cutting plane
- binary variables
- dynamic systems
- hidden variables
- maximum margin
- cost function