Valid inequalities for separable concave constraints with indicator variables
From MaRDI portal
(Redirected from Publication:1801013)
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
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- A polynomial time solvable concave network flow problem
- A study of the lot-sizing polytope
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs
- An algorithmic framework for MINLP with separable non-convexity
- BARON: A general purpose global optimization software package
- Disjunctive Programming
- Extending a CIP framework to solve MIQCPs
- Lifted flow cover inequalities for mixed 0-1 integer programs
- Mathematical programming techniques in water network optimization
- Minimum Concave Cost Flows in Certain Networks
- Minimum concave cost flow over a grid network
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- Mixed integer models for the stationary case of gas network optimization
- Mixed-integer nonlinear optimization
- Send-and-Split Method for Minimum-Concave-Cost Network Flows
- Sequence independent lifting in mixed integer programming
- Uncapacitated lot-sizing: The convex hull of solutions
- Valid Linear Inequalities for Fixed Charge Problems
- Valid inequalities for mixed 0-1 programs
- 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
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)
