Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2312.10670 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914797736427520 |
|---|---|
| author | Bagherpour, Negin Sharifzadeh, Mahdi |
| author_facet | Bagherpour, Negin Sharifzadeh, Mahdi |
| contents | Mixed integer nonlinear programming (MINLP) problems are encountered in modeling a physical/industrial process consisting both nonlinearity and discrete selective parameters. There are variety of algorithms for solving MINLP problems most of which solve large-scale MINLP problems very slowly. In this research two parallelization scheme are suggested for solving general and special structure large-scale MINLP problems satisfyingly fast. Special structure refers to problems in which a group of variables are appeared in the objective function and constraints and others are appeared in some constraints separately. Moreover, it is proved that both algorithms have at least R-linear convergence. To show the efficiency of algorithms, numerical test results are presented and compared to available GAMS solvers. According to the numerical results, in almost 80 percent of tests both algorithms compute the solution faster than the best solver in GAMS. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2312_10670 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | On Solving General and Special Structure Medium-Scale MINLP Problems Bagherpour, Negin Sharifzadeh, Mahdi Optimization and Control 65Y20 Mixed integer nonlinear programming (MINLP) problems are encountered in modeling a physical/industrial process consisting both nonlinearity and discrete selective parameters. There are variety of algorithms for solving MINLP problems most of which solve large-scale MINLP problems very slowly. In this research two parallelization scheme are suggested for solving general and special structure large-scale MINLP problems satisfyingly fast. Special structure refers to problems in which a group of variables are appeared in the objective function and constraints and others are appeared in some constraints separately. Moreover, it is proved that both algorithms have at least R-linear convergence. To show the efficiency of algorithms, numerical test results are presented and compared to available GAMS solvers. According to the numerical results, in almost 80 percent of tests both algorithms compute the solution faster than the best solver in GAMS. |
| title | On Solving General and Special Structure Medium-Scale MINLP Problems |
| topic | Optimization and Control 65Y20 |
| url | https://arxiv.org/abs/2312.10670 |