A method for convex curve approximation

DOI10.1016/0377-2217(95)00368-1zbMath0922.90066OpenAlexW2079511751MaRDI QIDQ1278603

C. J. Goh, Xiao Qi Yang

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00368-1

zbMATH Keywords

quadratic convergencesandwich methodbi-criteria convex quadratic network programconvex curve approximation

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Algorithms for approximation of functions (65D15)

Related Items (11)

A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem ⋮ Multiple objective minimum cost flow problems: a review ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets ⋮ Piecewise quadratic approximation of the non-dominated set for bi-criteria programs ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ The effect of transformations on the approximation of univariate (convex) functions with applications to Pareto curves ⋮ An optimal adaptive algorithm for the approximation of concave functions ⋮ How Good is the Chord Algorithm? ⋮ Approximation methods for non-convex curves ⋮ Approximation methods in multiobjective programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicriteria network flow problems: Continuous case
• The convergence rate of the sandwich algorithm for approximating convex functions
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Bicriteria Transportation Problem
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• An Algorithm for Non-Linear Network Programming: Implementation, Results and Comparisons
• Analytic efficient solution set for bi-criteria quadratic network programs
• A bad network problem for the simplex method and other minimum cost flow algorithms

This page was built for publication: A method for convex curve approximation