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

DOI10.11121/ijocta.01.2014.00171zbMath1338.90204OpenAlexW1993077742MaRDI QIDQ2809960

Abay Molla Kassa, Semu Mitiku Kassa

Publication date: 30 May 2016

Published in: An International Journal of Optimization and Control: Theories & Applications (IJOCTA) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.11121/ijocta.01.2014.00171

zbMATH Keywords

convex relaxationmulti-parametric programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Sensitivity, stability, parametric optimization (90C31) Management decision making, including multiple objectives (90B50) Mathematical programming (90C99)

Related Items (4)

A branch-and-bound multi-parametric programming approach for non-convex multilevel optimization with polyhedral constraints ⋮ Deterministic solution approach for some classes of nonlinear multilevel programs with multiple followers ⋮ A novel approach for solving multi-parametric problems with nonlinear constraints ⋮ Multilevel multi-leader multiple-follower games with nonseparable objectives and shared constraints

Uses Software

• Matlab

This page was built for publication: Approximate solution algorithm for multi-parametric non-convex programming problems with polyhedral constraints