A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems

Management Science- United States

doi 10.1287/mnsc.49.9.1268.16570

Full Text

Abstract

Available in

Date

Authors

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

Linear Decomposition Approach for a Class of Nonconvex Programming Problems

Journal of Inequalities and Applications
CombinatoricsApplied MathematicsAnalysisDiscrete Mathematics
2017English

Piecewise Linear Bounding of Univariate Nonlinear Functions and Resulting Mixed Integer Linear Programming-Based Solution Methods

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2019English

Chvátal Closures for Mixed Integer Programming Problems

Mathematical Programming, Series B
MathematicsSoftware
1990Danish

Identification of Piecewise Affine Systems via Mixed-Integer Programming

Automatica
ControlSystems EngineeringElectricalElectronic Engineering
2004English

A Mathematical Model for Solving Integer Linear Programming Problems

African Journal of Mathematics and Computer Science Research
2020English

Polyhedral Approaches to Mixed Integer Linear Programming

2009English

Duality Theorems for Non-Convex Mixed Integer Programming Problems

International Journal of Computing and Optimization
2016English

Rational Mixed-Integer and Polyhedral Union Minimization Models

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
1980English

An Exact Penalty Approach for Mixed Integer Nonlinear Programming Problems

American Journal of Operations Research
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy