Valid inequalities for separable concave constraints with indicator variables

DOI10.1007/s10107-017-1197-5zbMath1412.90094OpenAlexW2761119336MaRDI QIDQ1801013

Jeff Linderoth, Cong Han Lim, James R. Luedtke

Publication date: 26 October 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1197-5

zbMATH Keywords

convex hullvalid inequalitieslot sizing polyhedronsingle node flow

Mathematics Subject Classification ID

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

Related Items

\(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables

Uses Software

• BARON
• SCIP
• ANTIGONE

Cites Work

• Unnamed Item
• Mathematical programming techniques in water network optimization
• Valid inequalities for mixed 0-1 programs
• Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
• A study of the lot-sizing polytope
• 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
• Minimum concave cost flow over a grid network
• Mixed integer models for the stationary case of gas network optimization
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• An Algorithmic Framework for MINLP with Separable Non-Convexity
• Extending a CIP Framework to Solve MIQCPs
• Valid Inequalities for Separable Concave Constraints with Indicator Variables
• Uncapacitated lot-sizing: The convex hull of solutions
• Valid Linear Inequalities for Fixed Charge Problems
• Send-and-Split Method for Minimum-Concave-Cost Network Flows
• Disjunctive Programming
• A polynomial time solvable concave network flow problem
• Mixed-integer nonlinear optimization
• Minimum Concave Cost Flows in Certain Networks