Pages that link to "Item:Q4128278"

The following pages link to Objective function approximations in mathematical programming (Q4128278):

Displaying 27 items.

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