Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints
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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Balikesir University
2014-07-01
|
| Series: | An International Journal of Optimization and Control: Theories & Applications |
| Subjects: | |
| Online Access: | http://ijocta.balikesir.edu.tr/index.php/files/article/view/171/104 |