The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
type: Item
instance of: scholarly article
title: The piecewise linear optimization polytope: new inequalities and intersection with semi-continuous constraints
zbMATH Open document ID: 1274.90331
author: Ming Zhao
author: I. R. jun. de Farias
published in: Mathematical Programming. Series A. Series B
publication date: 2013-11-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 6225198
zbMATH Keywords: piecewise linear optimization
zbMATH Keywords: mixed-integer programming
zbMATH Keywords: knapsack problem
zbMATH Keywords: special ordered set
zbMATH Keywords: semi-continuous variables
zbMATH Keywords: polyhedral method
zbMATH Keywords: branch-and-cut
describes a project that uses: AMPL
MaRDI profile type: Publication
full work available at URL: s10107-012-0517-z
OpenAlex ID: W1972097069
cites work: Nonlinear Programming
cites work: Branch and Bound Methods for Mathematical Programming Systems
cites work: Q3864458
cites work: Q3686501
cites work: Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
cites work: Computational study of a family of mixed-integer quadratic programming problems
cites work: Solving nonlinear resistive networks using piecewise-linear analysis and simplicial subdivision
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
cites work: Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
cites work: Piecewise linear approximation of functions of two variables in MILP models
cites work: On the Significance of Solving Linear Programming Problems with Some Integer Variables
cites work: Integer Programming and Combinatorial Optimization
cites work: Branch-and-cut for separable piecewise linear optimization and intersection with semi-continuous constraints
cites work: A generalized assignment problem with special ordered sets: a polyhedral approach.
cites work: Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
cites work: A family of inequalities for the generalized assignment polytope
cites work: A polyhedral study of the cardinality constrained knapsack problem
cites work: A Discrete Optimization Approach to Large Scale Supply Networks Based on Partial Differential Equations
cites work: A special ordered set approach for optimizing a discontinuous separable piecewise linear function
cites work: Homotopies for computation of fixed points
cites work: Simulation of hybrid circuits in constraint logic programming
cites work: Models for representing piecewise linear cost functions
cites work: A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
cites work: Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
cites work: On the Solution of Discrete Programming Problems
cites work: Mixed integer models for the stationary case of gas network optimization
cites work: Integer and mixed-integer programming models: General properties
cites work: Mixed integer minimization models for piecewise-linear functions of a single variable
cites work: Numerical Optimization
cites work: Large-Scale Portfolio Optimization
cites work: On triangulations for computing fixed points
cites work: Nonconvex, lower semicontinuous piecewise linear optimization
cites work: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
DOI: 10.1007/S10107-012-0517-Z
description: scientific article; zbMATH DE number 6225198