Nonconvex, lower semicontinuous piecewise linear optimization
From MaRDI portal
Publication:951120
DOI10.1016/j.disopt.2007.07.001zbMath1190.90149OpenAlexW2074519331MaRDI QIDQ951120
Juan Pablo Vielma, Nemhauser, George I., Ahmet Burak Keha
Publication date: 29 October 2008
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2007.07.001
Nonconvex programming, global optimization (90C26) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items
A PLMF-based decomposition-coordination algorithm for fuzzy linear programming in industrial applications, A branch-cut-and-price algorithm for the piecewise linear transportation problem, Global optimization of non-convex piecewise linear regression splines, The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints, On modelling non-linear quantity discounts in a supplier selection problem by mixed linear integer optimization, Exact penalty and optimality condition for nonseparable continuous piecewise linear programming, Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs, Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints, A Combinatorial Approach for Small and Strong Formulations of Disjunctive Constraints, Multiple criteria decision making for linguistic judgments with importance quantifier guided ordered weighted averaging operator, On piecewise linear approximations of bilinear terms: structural comparison of univariate and bivariate mixed-integer programming formulations, Fitting piecewise linear continuous functions, On linear programs with linear complementarity constraints, Incremental and encoding formulations for mixed integer programming, A special ordered set approach for optimizing a discontinuous separable piecewise linear function, Three methods for robust grading, Models and solution techniques for production planning problems with increasing byproducts, A computational analysis of multidimensional piecewise-linear models with applications to oil production optimization, Modeling disjunctive constraints with a logarithmic number of binary variables and constraints, Mixed Integer Linear Programming Formulation Techniques
Uses Software
Cites Work
- Unnamed Item
- A special ordered set approach for optimizing a discontinuous separable piecewise linear function
- Valid inequalities and separation for uncapacitated fixed charge networks
- Valid inequalities for mixed 0-1 programs
- Submodularity and valid inequalities in capacitated fixed charge networks
- Strong formulations for mixed integer programming: A survey
- Modelling piecewise linear concave costs in a tree partitioning problem
- Models for representing piecewise linear cost functions
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Valid inequalities and separation for capacitated fixed charge flow problems
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
- Valid Linear Inequalities for Fixed Charge Problems
- A composite algorithm for a concave-cost network flow problem
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
