Papers › Surface Movement Method for Linear Programming
Surface Movement Method for Linear Programming
Nikolay A. Olkhovsky, Leonid B. Sokolinsky
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The article presents a new method of linear programming, called the surface movement method. This method constructs an optimal objective path on the surface of the feasible polytope from the initial boundary point to the point at which the optimal value of the objective function is achieved. The optimality of the path means moving in the direction of maximum increase/decrease in the value of the objective function. A formal description of the algorithm implementing the surface movement method is described. The convergence theorem of this algorithm is proved. The presented method can be effectively implemented using a feed forward deep neural network to determine the optimal direction of movement along the faces of the feasible polytope. To do this, a multidimensional local image of the linear programming problem is constructed at the point of the current approximation. This image is fed to the input of the deep neural network, which returns a vector determining the direction of the optimal objective path on the polytope surface.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections