.png){kind=icon}
.png){kind=icon}
Return
Objective Variation Simplex Algorithm for Continuous Piecewise Linear Programming
.png){kind=icon}
OA
AI
DOI：10.1109/TST.2017.7830897.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper works on a modified simplex algorithm for the local optimization of Continuous PieceWise Linear (CPWL) programming with generalization of hinging hyperplane objective and linear constraints. CPWL programming is popular since it can be equivalently transformed into difference of convex functions programming or concave optimization. Inspired by the concavity of the concave CPWL functions, we propose an Objective Variation Simplex Algorithm (OVSA), which is able to find a local optimum in a reasonable time. Computational results are presented for further insights into the performance of the OVSA compared with two other algorithms on random test problems.
Keywords:
local optimization
continuous piecewise linear programming
modified simplex algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
T
IF:
3.5
Papers:
987
Citations:
2.5K