A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP

This repository contains the benchmark results of the paper "A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP" by Z. Peng, K. Cao, K.C. Furman, C. Li, I.E. Grossmann, and D.E. Bernal. You can view the detailed results on the web page.

The implementation of the proposed methods is based on MindtPy, the Mixed-Integer Nonlinear Decomposition Toolbox in Pyomo. For more information about MindtPy, please refer to the Pyomo MindtPy documentation.

The benchmark results for each instance are stored as trace files. For more information about trace files, please refer to the GAMS trace file documentation.

The software Paver 2 is used to process the trace files and analyze the performance of the proposed methods in this work.

MINLP Instances

All the MINLP instances benchmarked here are from MINLPLib, including

1. 434 convex MINLP instances
2. 181 nonconvex MINLP instances

Project Structure

.
├── LICENSE
├── README.md           # Project overview and structure
├── _config.yml         # Configuration file for GitHub Pages
├── index.md            # Main page of the website
├── minlp_instances     # Folder containing the list of convex and nonconvex MINLP instances
├── paver_results       # Folder containing Paver results
└── trace_file          # Folder containing trace files