Optimization Online


Four good reasons to use an Interior Point solver within a MIP solver

Timo Berthold(timoberthold***at***fico.com)
Michael Perregaard(michaelperregaard***at***fico.com)
Csaba Mészáros(csabameszaros***at***fico.com)

Abstract: "Interior point algorithms are a good choice for solving pure LPs or QPs, but when you solve MIPs, all you need is a dual simplex." This is the common conception which disregards that an interior point solution provides some unique structural insight into the problem at hand. In this paper, we will discuss some of the benefits that an interior point solver brings to the solution of difficult MIPs within FICO Xpress. This includes many different components of the MIP solver such as branching variable selection, primal heuristics, preprocessing, and of course the solution of the LP relaxation.

Keywords: mixed integer programming; interior point algorithm; Newton barrier method; analytic center

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

Citation: urn:nbn:de:0297-zib-64599 ZIB-Report 17-42, July 2017

Download: [PDF]

Entry Submitted: 07/18/2017
Entry Accepted: 07/18/2017
Entry Last Modified: 07/18/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