An Application of Linear Programming to Curve Fitting

Abstract

Previous article Next article An Application of Linear Programming to Curve FittingJames E. Kelley, Jr.James E. Kelley, Jr.https://doi.org/10.1137/0106002PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] A. Charnes and , C. E. Lemke, Minimization of nonlinear separable convex functionals, Naval Res. Logist. Quart., 1 (1954), 301–312 (1955) MR0074104 CrossrefGoogle Scholar[2] George B. Dantzig, , Alex Orden and , Philip Wolfe, The generalized simplex method for minimizing a linear form under linear inequality restraints, Pacific J. Math., 5 (1955), 183–195 MR0069584 0064.39402 CrossrefGoogle Scholar[3] Allen A. Goldstein, , Norman Levine and , James B. Herreshoff, On the "best" and "least qth" approximation of an overdetermined system of linear equations, J. Assoc. Comput. Mach., 4 (1957), 341–347 MR0093897 CrossrefISIGoogle Scholar[4] A. Shenitzer, Chebyshev approximation of a continuous function by a class of functions, J. Assoc. Comput. Mach., 4 (1957), 30–35 MR0093892 CrossrefISIGoogle Scholar[5] P. Wolfe, The simplex method for quadratic programming, RAND Report No. P-1205, The RAND Corporation, 1957, Nov. Google Scholar Previous article Next article FiguresRelatedReferencesCited byDetails Applications of Linear Programming to Numerical Analysis18 July 2006 | SIAM Review, Vol. 10, No. 2AbstractPDF (3637 KB)The Cutting-Plane Method for Solving Convex ProgramsJ. E. Kelley, Jr.10 July 2006 | Journal of the Society for Industrial and Applied Mathematics, Vol. 8, No. 4AbstractPDF (979 KB) Volume 6, Issue 1| 1958Journal of the Society for Industrial and Applied Mathematics History Submitted:11 October 1957Published online:28 July 2006 InformationCopyright © 1958 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/0106002Article page range:pp. 15-22ISSN (print):0368-4245ISSN (online):2168-3484Publisher:Society for Industrial and Applied Mathematics