| Article ID: | iaor20032505 |
| Country: | Germany |
| Volume: | 93 |
| Issue: | 2 |
| Start Page Number: | 247 |
| End Page Number: | 263 |
| Publication Date: | Jan 2002 |
| Journal: | Mathematical Programming |
| Authors: | Sahinidis N.V., Tawarmalani M. |
We define a convex extension of a lower semi-continuous function to be a convex function that is identical to the given function over a pre-specified subset of its domain. Convex extensions are not necesssarily constructible or unique. We identify conditions under which a convex extension can be constructed. When multiple convex extensions exist, we characterize the tightest convex extension in a well-defined sense. Using the notion of a generating set, we establish conditions under which the tightest convex extension is the convex envelope. Then, we employ convex extensions to develop a constructive technique for deriving convex envelopes of nonlinear functions. Finally, using the theory of convex extensions we characterize the precise gaps exhibited by various underestimators of