Approximation methods for non-convex curves

zbMath1009.90134MaRDI QIDQ1847152

Yanqun Liu, Xiao Qi Yang, Kok Lay Teo

Publication date: 17 November 2002

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

zbMATH Keywords

approximation methodquadratic convergenceconvexificationbi-criteria optimizationnon-convex curve

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Algorithms for approximation of functions (65D15)

Related Items (2)

A new scalarization technique to approximate Pareto fronts of problems with disconnected feasible sets ⋮ A methodology for assessing eco-efficiency in logistics networks

Cites Work

• Multiobjective programming and planning
• The convergence rate of the sandwich algorithm for approximating convex functions
• A method for convex curve approximation
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• Convexification of a noninferior frontier
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximation methods for non-convex curves