Research index
Non-Iterative Linear Maximization Algorithm
Febres
Figshare1 Jan 2019Open access
NobleIDark:/48914/w1/20261005/70452CD4DOI10.6084/m9.figshare.7928948.v2
Open access
Non-Iterative Linear Maximization Algorithm
Febres · Figshare · 2019
NobleIDark:/48914/w1/20261005/70452CD4DOI10.6084/m9.figshare.7928948.v2
Abstract
Explicit C sharp code for the Linear Optimization algorithm based on active constraints recognition. The algorithm is not iterative and its complexity is comparable to the Simplex algorithm. To have the code working, copying it and pasting on Visual Studio may work. Search "A non-iterative method for optimizing linear functions in convex linearly constrained spaces" by Gerardo L. Febres for the theoretical basis of this algorithm.