On Constrained Programming Problems with Singular Designs via Super Convergent Line Series.

Publication Date: 18/07/2025

DOI: 10.52589/AJMSS-X1ML91KI


Author(s): Thomas Adidaumbe Ugbe, Richmond Ofonodo, Edet Effiong Bassey, Stephen Sebastian Akpan.
Volume/Issue: Volume 8, Issue 3 (2025)
Page No: 1-14
Journal: African Journal of Mathematics and Statistics Studies (AJMSS)


Abstract:

The study extends the Super Convergent Line Series Algorithm to a case where the determinant information matrix of the design is zero by employing the Moore-Penrose inverse approach. The algorithm is tested using a numerical example on a constrained programming problem. The optimal solution obtained by the algorithm compares favorably with the one obtained by an existing Frank-Wolfe method and the value of the optimizer satisfies the given constraint equation.

Keywords:

Algorithm, Direction Vector, Support Points, Optimizer, Information Matrix.

No. of Downloads: 0
View: 409



This article is published under the terms of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
CC BY-NC-ND 4.0