Optimal approximation of convex curves by functions which are piecewise linear

DOI10.1016/0022-247X(75)90095-5zbMath0317.65005MaRDI QIDQ1222010

Momcilo M. Gavrilovic

Publication date: 1975

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Best approximation, Chebyshev systems (41A50) Rate of convergence, degree of approximation (41A25)

Related Items (6)

Piecewise linear lower and upper bounds for the standard normal first order loss function ⋮ A mixed integer programming formulation for the stochastic lot sizing problem with controllable processing times ⋮ An Extended Mixed-Integer Programming Formulation and Dynamic Cut Generation Approach for the Stochastic Lot-Sizing Problem ⋮ Heuristics for the stochastic economic lot sizing problem with remanufacturing under backordering costs ⋮ Integrating unimodality into distributionally robust optimal power flow ⋮ Mixed-integer linear methods for layout-optimization of screening systems in recovered paper production

Cites Work

• Approximation of Curves by Line Segments
• On the approximation of curves by line segments using dynamic programming
• Optimal Curve Fitting With Piecewise Linear Functions

This page was built for publication: Optimal approximation of convex curves by functions which are piecewise linear