Composite unimodality
定义了一类称为复合单峰的单变量函数，并展示了如何通过有效的搜索过程最小化这类函数，虽然效率不如斐波那契搜索。通过一个实际物流问题的近似拉格朗日方法，发现其目标函数是复合单峰的，这种函数形式可能在未来实际问题中遇到。
This article defines a class of univariate functions termed composite unimodal, and shows how their minimization admits an effective search procedure, albeit one not as efficient as is Fibonacci search for unimodal functions. An approximate Lagrangian approach to an important real-world logistics problem is seen to yield a surrogate problem whose objective function is composite unimodal. The mathematical form of this objective function is likely to be encountered in solving future real-world problems. © 1993 John Wiley & Sons, Inc.