Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints

An International Journal of Optimization and Control: Theories & Applications

article

Abay Molla Kassa¹  Semu Mitiku Kassa² 

[1] Addis Ababa Institute of Technology,Addis Ababa University;Addis Ababa University

关键词: Multi-parametric Programming;    Convex relaxation;   

DOI  :  10.11121/ijocta.01.2014.00171

学科分类：地球科学(综合)

来源: Balikesir University

【 摘 要 】

In this paper, we developed a novel algorithmic approach for thesolution of multi-parametric non-convex programming problems withcontinuous decision variables. The basic idea of the proposedapproach is based on successive convex relaxation of each non-convexterms and sensitivity analysis theory. The proposed algorithm isimplemented using MATLAB software package and numericalexamples are presented to illustrate the effectiveness andapplicability of the proposed method on multi-parametric non-convexprogramming problems with polyhedral constraints.

【 授权许可】

CC BY