A nonconvex, piecewise linear optimization problem

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

James E. Falk, Bahia Benchekroun

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90162-w

zbMATH Keywords

branch and boundlinear interpolationDelaunay Decomposition

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

An algorithm for piece-wise indefinite quadratic programming problem

Cites Work

• Two algorithms for constructing a Delaunay triangulation
• Unnamed Item