On Implementing a Two-Step Interior Point Method for Solving Linear Programs
A new two-step interior point method for solving linear programs is presented. The technique uses a convex combination of the auxiliary and central points to compute the search direction. To update the central point, we find the best value for step size such that the feasibility condition is held. S...
| Հիմնական հեղինակներ: | , , |
|---|---|
| Ձևաչափ: | Հոդված |
| Լեզու: | English |
| Հրապարակվել է: |
MDPI AG
2024-07-01
|
| Շարք: | Algorithms |
| Խորագրեր: | |
| Առցանց հասանելիություն: | https://www.mdpi.com/1999-4893/17/7/303 |