Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints
Keywords:Multi-parametric Programming, Convex relaxation
AbstractIn 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.
Li Z. and Ierapetritou G. M., A New Methodology for the General Multiparametric Mixed-Integer Linear Programming (MILP) Problems, Industrial & Engineering Chemistry Research, 46, 5141-5151 (2007). CrossRef
Dua V. Bozinis A. N. and Pistikopoulos N. E., A multi-parametric Programming Approach for mixed-integer quadratic engineering problems, Computers & Chemical Engineering, 26, 715-733 (2002). CrossRef
Pistikopous, N. E., Georgiads C. M. and Dua V., (Ed-itors) Multiparametric programming: Theory, algorithm, and application, WILEY-VCH Verlag GmbH and Co. KGaA, (2007).
Dua V., Pistikopoulos, E. N., An algorithm for the solution of multiparametric mixed integer linear programming problems, Annals of Operations Research, 99, 123 - 139 (2001). CrossRef
Faâ€™Ä±sca P. N, Dua V., Rustem B., Saraiva M. P., Pistikopoulos N. E., Parametric global optimisation for bilevel programming, Journal of Global Optimization, 38, 609-623 (2006). CrossRef
Faâ€™Ä±sca P. N., Saraiva M. P., Rustem B., Pistikopoulos N. E. A multiparametric programming approach for multilevel hierarchical and decentralized optimization problems, Computational Management Science, 6, 377-397 (2009). CrossRef
TÃ¸ndel P., Johansen T. A. and Bemporad A., Further Results on Multiparametric Quadratic Programming, in Proceedings of 42nd IEEE Conference on Decision and Control, 3, 3173-3178 (2003).
Al-Khayyal A. F., Jointly constrained bilinear programms and related problems: An overview, Computers Math. Applic, 19, 53-62 (1990).
Adjiman S. C., Dallwing S., Floudas A. C., Neumaier A., A global optimization method, Î±BB, for general twice-differentiable constrained NLPs I.Theoretical advances, Computers and Chemical Engineering, 22, 1137 - 1158 (1998). CrossRef
Androulakis P. I., Maranas D. C., and Floudas A. C., Î±BB: A Global Optimization Method for General Constrained Nonconvex Problems, Journal of Global Optimization, 7, 337-363 (1995). CrossRef
Fiacco V. A., Sensitivity analysis for nonlinear programming using penalty methods, Mathematical Programming, 10, 287-311 (1976). CrossRef
Fiacco V. A., Introduction to Sensitivity and Stability Analysis in Nonlinear Programming, Academic press, (1983).
How to Cite
Articles published in IJOCTA are made freely available online immediately upon publication, without subscription barriers to access. All articles published in this journal are licensed under the Creative Commons Attribution 4.0 International License (click here to read the full-text legal code). This broad license was developed to facilitate open access to, and free use of, original works of all types. Applying this standard license to your work will ensure your right to make your work freely and openly available.
Under the Creative Commons Attribution 4.0 International License, authors retain ownership of the copyright for their article, but authors allow anyone to download, reuse, reprint, modify, distribute, and/or copy articles in IJOCTA, so long as the original authors and source are credited.
The readers are free to:
- Share — copy and redistribute the material in any medium or format
- Adapt — remix, transform, and build upon the material
- for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
under the following terms:
- Attribution — You must give appropriate credit, provide a link to the license, and indicate if changes were made. You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
This work is licensed under a Creative Commons Attribution 4.0 International License.