Piecewise linear optimization

DOI10.1007/BF02243882MaRDI QIDQ1143319zbMATH OpenFDO

Authors Johann K. Brunner

Publication date 1980

Published in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02243882

zbMATH Keywords

linear restrictionspiecewise linear optimizationpiecewise linear, convex, continuous objective functionreduced gradient methodsimplex algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Convex programming (90C25)

Cites work

• Die Methode der „direkten Koeffizientenanpassung“ (μ-Form) des Separable Programming
• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 3466802 (Why is no real title available?)
• scientific article; zbMATH DE number 3494173 (Why is no real title available?)
• scientific article; zbMATH DE number 3286663 (Why is no real title available?)
• The Convex Simplex Method

Cited in

(2)

• Piecewise linear optimization: Duality and numerical results
• An effective method for solving linear programming problems with flexible constraints

This page was built for publication: Piecewise linear optimization

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