Objective Variation Simplex Algorithm for Continuous Piecewise Linear Programming

Yu Bai

doi:10.1109/TST.2017.7830897

Objective Variation Simplex Algorithm for Continuous Piecewise Linear Programming

2017-02-01

1

OA

AI

DOI：10.1109/TST.2017.7830897

原文链接

查看原文

摘要

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.

Keyword:

local optimization

continuous piecewise linear programming

modified simplex algorithm

Objective Variation Simplex Algorithm for Continuous Piecewise Linear Programming

摘要

AI总结

期刊

机构

引用论文