mixed-integer programming

Facets of the Complementarity Knapsack Polytope

  • Ellis L. Johnson
  • George L. Nemhauser
  • Ismael de Farias
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms Tags , ,

    We present a polyhedral study of the complementarity knapsack problem, in which no auxiliary binary variables are introduced, but rather the inequalities are derived in the space of the continuous variables. Citation School of Industrial and Systems Engineering, GA Tech, under review Article Download View Facets of the Complementarity Knapsack Polytope

    On the Value of Binary Expansions For General Mixed-Integer Linear Programs

  • Jonathan Owen
  • Sanjay Mehrotra
    • Categories (Mixed) Integer Linear Programming, Optimization Software and Modeling Systems Tags

    We study the use of binary variables in reformulating general mixed-integer linear programs. We show that binary reformulations result in problems for which almost all the binary variables replacing a general integer variable need to be explored during branching. We also give computational results on the performance of such reformulations in solving the mixed-integer programs, … Read more