Valid inequalities for separable concave constraints with indicator variables
From MaRDI portal
Publication:1801013
DOI10.1007/S10107-017-1197-5zbMATH Open1412.90094OpenAlexW2761119336MaRDI QIDQ1801013FDOQ1801013
Authors: Cong Han Lim, Jeff Linderoth, James 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
Recommendations
- Valid inequalities for separable concave constraints with indicator variables
- Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
- scientific article; zbMATH DE number 5662944
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Valid inequalities for quadratic optimisation with domain constraints
- On the convexification of constrained quadratic optimization problems with indicator variables
- On valid inequalities for quadratic programming with continuous variables and binary indicators
- Ideal formulations for constrained convex optimization problems with indicator variables
- Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
- A constraint qualification for convex programming
Cites Work
- BARON: A general purpose global optimization software package
- Extending a CIP framework to solve MIQCPs
- Mixed-integer nonlinear optimization
- Title not available (Why is that?)
- Sequence independent lifting in mixed integer programming
- Mixed integer models for the stationary case of gas network optimization
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Disjunctive Programming
- A study of the lot-sizing polytope
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Minimum concave cost flow over a grid network
- Mathematical programming techniques in water network optimization
- Minimum Concave Cost Flows in Certain Networks
- Valid inequalities for mixed 0-1 programs
- Valid Linear Inequalities for Fixed Charge Problems
- Uncapacitated lot-sizing: The convex hull of solutions
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- A polynomial time solvable concave network flow problem
- An algorithmic framework for MINLP with separable non-convexity
- Valid inequalities for separable concave constraints with indicator variables
Cited In (6)
- On valid inequalities for quadratic programming with continuous variables and binary indicators
- \(2 \times 2\)-convexifications for convex quadratic optimization with indicator variables
- Valid inequalities for concave piecewise linear regression
- Valid inequalities for separable concave constraints with indicator variables
- Perspective Relaxation of Mixed Integer Nonlinear Programs with Indicator Variables
- Convergence criteria for interval-valued inequality indices
Uses Software
This page was built for publication: Valid inequalities for separable concave constraints with indicator variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1801013)
