Optimization Online


On Pathological Disjunctions and Redundant Disjunctive Conic Cuts

Mohammad Shahabsafa(mos313***at***lehigh.edu)
Julio C. Goez(Julio.Goez***at***nhh.no)
Tamas Terlaky(terlaky***at***lehigh.edu)

Abstract: The development of Disjunctive Conic Cuts (DCCs) for Mixed Integer Second Order Cone Optimization (MISOCO) problems has recently gained significant interest in the optimization community. In this paper, we explore the pathological disjunctions where disjunctive cuts do not tighten the description of the feasible set. We focus on the identification of cases when the generated DCCs are redundant. Avoiding the generation of redundant cuts saves computational time and facilitates efficient implementation of branch and cut algorithms.

Keywords: Conic Optimization, Disjunctive Conic Cuts, Mixed Integer Second Order Cone Optimization

Category 1: Integer Programming

Category 2: Linear, Cone and Semidefinite Programming (Second-Order Cone Programming )

Citation: ISE Technical Report 17T-010, Industrial and Systems Engineering Department, Lehigh University, 200 W Packer Ave, Bethlehem, PA, September 2017

Download: [PDF]

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