Objective function approximations in mathematical programming

DOI10.1007/BF01584321zbMath0356.90062OpenAlexW2156060532MaRDI QIDQ4128278

A. M. Geoffrion

Publication date: 1977

Published in: Mathematical Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Nonlinear programming (90C30) Best approximation, Chebyshev systems (41A50)

Related Items

A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities, A generator and a simplex solver for network piecewise linear programs, Aggregation in hub location problems, Optimal objective function approximation for separable convex quadratic programming, A MILP formulation for generalized geometric programming using piecewise-linear approximations, Sandwich approximation of univariate convex functions with an application to separable convex programming, Distributed monitoring problem, Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions, Supply chain design considering economies of scale and transport frequencies, Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems, Determination of general equilibrium with incomplete markets and default penalties, Models and solution techniques for production planning problems with increasing byproducts, Nondifferentiable optimization via smooth approximation: General analytical approach, New model and heuristics for safety stock placement in general acyclic supply chain networks, On characterizingL 1-supports, natural and Chebyshev approximates, On the multisource hyperplanes location problem to fitting set of points, A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems, Aggregation error for location models: Survey and analysis, An effective linear approximation method for separable programming problems, A smoothing-out technique for min—max optimization, Computational aspects of two-segment separable programming, A min-max algorithm for non-linear regression models, On the convexification of nonlinear programming problems: An applications-oriented survey, Perturbation theory for mathematical programming problems, A branch-and-price approach for the continuous multifacility monotone ordered median problem, Average shadow prices in mathematical programming, An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions

Cites Work

• A priori error bounds for procurement commodity aggregation in logistics planning models
• Optimization with an approximate Lagrangian
• Unnamed Item
• Unnamed Item