Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.12640 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929320603156480 |
|---|---|
| author | Olkhovsky, Nikolay A. Sokolinsky, Leonid B. |
| author_facet | Olkhovsky, Nikolay A. Sokolinsky, Leonid B. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_12640 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Surface Movement Method for Linear Programming Olkhovsky, Nikolay A. Sokolinsky, Leonid B. Optimization and Control 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. |
| title | Surface Movement Method for Linear Programming |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2404.12640 |