Objective function approximations in mathematical programming
From MaRDI portal
Cites work
Cited in
(27)- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
- Determination of general equilibrium with incomplete markets and default penalties
- 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 smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
- A smoothing-out technique for min—max optimization
- A generator and a simplex solver for network piecewise linear programs
- On the multisource hyperplanes location problem to fitting set of points
- Supply chain design considering economies of scale and transport frequencies
- Models and solution techniques for production planning problems with increasing byproducts
- A MILP formulation for generalized geometric programming using piecewise-linear approximations
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- Distributed monitoring problem
- An effective linear approximation method for separable programming problems
- Error analysis for convex separable programs: Bounds on optimal and dual optimal solutions
- Aggregation error for location models: Survey and analysis
- Optimal objective function approximation for separable convex quadratic programming
- Aggregation in hub location problems
- Sandwich approximation of univariate convex functions with an application to separable convex programming
- Nondifferentiable optimization via smooth approximation: General analytical approach
- A min-max algorithm for non-linear regression models
- Perturbation theory for mathematical programming problems
- Computational aspects of two-segment separable programming
- New model and heuristics for safety stock placement in general acyclic supply chain networks
- On the convexification of nonlinear programming problems: An applications-oriented survey
- On characterizingL 1-supports, natural and Chebyshev approximates
This page was built for publication: Objective function approximations in mathematical programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4128278)
