A nonconvex, piecewise linear optimization problem

DOI10.1016/0898-1221(91)90162-WzbMath0719.90060MaRDI QIDQ2640447

James E. Falk, Bahia Benchekroun

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

branch and bound; linear interpolation; Delaunay Decomposition

Mathematics Subject Classification ID

90C26: Nonconvex programming, global optimization

90C05: Linear programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Cites Work

• Two algorithms for constructing a Delaunay triangulation
• Unnamed Item