Global optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorithm for global optimization of the MIPP problems, in which, first, the MIPP is reformulated as a multi-parametric programming by considering integer variables as parameters. Then, the optimality conditions of resulting parametric programming give a parametric polynomial equations system (PES) that is solved analytically by Grobner Bases (GB) theory. After solving PES, the parametric optimal solution as a function of the relaxed integer variables is obtained. A simple discrete optimization problem is resulted for any non-imaginary parametric solution of PES, which the global optimum solution of MIPP is determined by comparing their optimal value. Some numerical examples are provided to clarify proposed algorithm and extend it for solving the MINLP problems. Finally, a performance analysis is conducted to demonstrate the practical efficiency of the proposed method.
Language:
English
Published:
Journal of Industrial and Systems Engineering, Volume:11 Issue: 3, Summer 2018
Pages:
1 to 15
https://www.magiran.com/p1908712  
سامانه نویسندگان
از نویسنده(گان) این مقاله دعوت می‌کنیم در سایت ثبت‌نام کرده و این مقاله را به فهرست مقالات رزومه خود پیوست کنند. راهنما
مقالات دیگری از این نویسنده (گان)