Valid inequalities for separable concave constraints with indicator variables
type: Item
instance of: scholarly article
title: Valid inequalities for separable concave constraints with indicator variables
zbMATH Open document ID: 1412.90094
author: Cong Han Lim
author: Jeff Linderoth
author: James Luedtke
published in: Mathematical Programming. Series A. Series B
publication date: 2018-10-26T00:00:00Z
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6966237
zbMATH Keywords: valid inequalities
zbMATH Keywords: convex hull
zbMATH Keywords: lot sizing polyhedron
zbMATH Keywords: single node flow
describes a project that uses: SCIP
describes a project that uses: BARON
describes a project that uses: ANTIGONE
MaRDI profile type: Publication
full work available at URL: s10107-017-1197-5
OpenAlex ID: W2761119336
cites work: A study of the lot-sizing polytope
cites work: Disjunctive Programming
cites work: Uncapacitated lot-sizing: The convex hull of solutions
cites work: Mixed-integer nonlinear optimization
cites work: Extending a CIP Framework to Solve MIQCPs
cites work: Algorithms and Software for Convex Mixed Integer Nonlinear Programs
cites work: Mathematical programming techniques in water network optimization
cites work: An Algorithmic Framework for MINLP with Separable Non-Convexity
cites work: Send-and-Split Method for Minimum-Concave-Cost Network Flows
cites work: Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
cites work: Sequence independent lifting in mixed integer programming
cites work: Minimum concave-cost network flow problems: Applications, complexity, and algorithms
cites work: A polynomial time solvable concave network flow problem
cites work: Minimum concave cost flow over a grid network
cites work: Valid Inequalities for Separable Concave Constraints with Indicator Variables
cites work: Mixed integer models for the stationary case of gas network optimization
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Q4040221
cites work: Valid Linear Inequalities for Fixed Charge Problems
cites work: BARON: A general purpose global optimization software package
cites work: Valid inequalities for mixed 0-1 programs
cites work: Minimum Concave Cost Flows in Certain Networks
DOI: 10.1007/S10107-017-1197-5
Recommended article: Valid Inequalities for Separable Concave Constraints with Indicator Variables
Recommended article: Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
Recommended article: Q5852066
Recommended article: Sufficient optimality criterion for linearly constrained, separable concave minimization problems
Recommended article: Valid inequalities for quadratic optimisation with domain constraints
Recommended article: On the Convexification of Constrained Quadratic Optimization Problems with Indicator Variables
Recommended article: On Valid Inequalities for Quadratic Programming with Continuous Variables and Binary Indicators
Recommended article: Ideal formulations for constrained convex optimization problems with indicator variables
Recommended article: Constraint Qualifications for Convex Inequality Systems with Applications in Constrained Optimization
Recommended article: A constraint qualification for convex programming
description: scientific article; zbMATH DE number 6966237