A Simplex Algorithm for the Local Minimization of a Box-Constrained Concave Quadratic Program

In this work, we extend the simplex algorithm of linear programming for finding a local minimum of a concave quadratic function subject to box constraints. In order to test the performance of the proposed algorithm, we have developed an implementation with MATLAB. The simplex algorithm is tested on...

Celý popis

Podrobná bibliografia

Vydané v:	2024 International Conference of the African Federation of Operational Research Societies (AFROS) s. 1 - 6
Hlavní autori:	Bentobache, Mohand, Telli, Mohamed, Mokhtari, Abdelkader
Médium:	Konferenčný príspevok..
Jazyk:	English
Vydavateľské údaje:	IEEE 03.11.2024
Predmet:	Algorithms Box-constrained concave quadratic programming Computer languages Libraries Linear programming Local minimum Mathematical models MATLAB Minimization Numerical experiments Optimization Physics Quadratic programming Simplex algorithm
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!