Objective variation simplex algorithm for continuous piecewise linear programming

DOI10.1109/TST.2017.7830897MaRDI QIDQ3132735zbMATH OpenOpenAlexFDO

Authors Yu Bai, Zhiming Xu, Xiangming Xi, Shuning Wang

Publication date 29 January 2018

Published in Tsinghua Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tst.2017.7830897

zbMATH Keywords

local optimizationcontinuous piecewise linear programmingmodified simplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05)

Recommendations

• Hill tunneling method via peak subpoints for continuous piecewise linear programming
• Piecewise-linear programming: The compact (CPLP) algorithm
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• A simplex algorithm for piecewise-linear fractional programming problems
• A simplex algorithm for piecewise-linear programming I: Derivation and proof

Cited in

(4)

• Piecewise-linear programming: The compact (CPLP) algorithm
• Hill tunneling method via peak subpoints for continuous piecewise linear programming
• scientific article; zbMATH DE number 1782578 (Why is no real title available?)
• A parametric simplex algorithm for biobjective piecewise linear programming problems

This page was built for publication: Objective variation simplex algorithm for continuous piecewise linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132735)