Valid Inequalities for Separable Concave Constraints with Indicator Variables

DOI10.1007/978-3-319-33461-5_23zbMath1419.90077OpenAlexW2465942306MaRDI QIDQ3186509

Cong Han Lim, Jeff Linderoth, James R. Luedtke

Publication date: 10 August 2016

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33461-5_23

zbMATH Keywords

global optimizationvalid inequalitiesmixed integer nonlinear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26)

Related Items

Valid inequalities for separable concave constraints with indicator variables

Uses Software

• BARON
• SCIP
• ANTIGONE

Cites Work

• Unnamed Item
• Unnamed Item
• Mathematical programming techniques in water network optimization
• Conic mixed-integer rounding cuts
• Valid inequalities for mixed 0-1 programs
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• BARON: A general purpose global optimization software package
• Sequence independent lifting in mixed integer programming
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• Minimum concave-cost network flow problems: Applications, complexity, and algorithms
• Perspective cuts for a class of convex 0-1 mixed integer programs
• Mixed integer models for the stationary case of gas network optimization
• Extending a CIP Framework to Solve MIQCPs
• Valid Linear Inequalities for Fixed Charge Problems
• Disjunctive Programming
• On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators