Optimization Online


MILP feasibility by nonlinear programming

Leo Liberti(liberti***at***lix.polytechnique.fr)

Abstract: We discuss a tightly feasible mixed-integer linear programs arising in the energy industry, for which branch-and-bound appears to be ineffective. We consider its hardness, measure the probability that randomly generated instances are feasible or almost feasible, and introduce heuristic solution methods based on relaxing different constraints of the problem. We show the computational efficiency of our simplest heuristic (a multi-start based on a linear complementarity programming reformulation of the given problem) with respect to a state-of-the-art branch-and-bound implementation.

Keywords: MILP, feasibility, NLP

Category 1: Integer Programming (0-1 Programming )

Category 2: Nonlinear Optimization (Quadratic Programming )

Category 3: Integer Programming ((Mixed) Integer Linear Programming )


Download: [PDF]

Entry Submitted: 12/03/2017
Entry Accepted: 12/03/2017
Entry Last Modified: 12/03/2017

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society