Objective function approximations in mathematical programming
From MaRDI portal
Publication:4128278
DOI10.1007/BF01584321zbMath0356.90062MaRDI QIDQ4128278
Publication date: 1977
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items
On the convexification of nonlinear programming problems: An applications-oriented survey, A min-max algorithm for non-linear regression models, Perturbation theory for mathematical programming problems, Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions, Nondifferentiable optimization via smooth approximation: General analytical approach, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, Average shadow prices in mathematical programming, A generator and a simplex solver for network piecewise linear programs, Optimal objective function approximation for separable convex quadratic programming, On characterizingL 1-supports, natural and Chebyshev approximates, Computational aspects of two-segment separable programming, A smoothing-out technique for min—max optimization, An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions, Sandwich approximation of univariate convex functions with an application to separable convex programming
Cites Work
