Global minimization of large-scale constrained concave quadratic problems by separable programming
Mathematical Programming: Series A and B
An algorithm for global minimization of linearly constrained concave quadratic functions
Mathematics of Operations Research
Using convex envelopes to solve the interactive fixed-charge linear programming problem
Journal of Optimization Theory and Applications
A Convex Envelope Formula for Multilinear Functions
Journal of Global Optimization
Journal of Global Optimization
Analysis of Bounds for Multilinear Functions
Journal of Global Optimization
Semidefinite Relaxations of Fractional Programs via Novel Convexification Techniques
Journal of Global Optimization
A branch-and-bound algorithm for maximizing the sum of several linear ratios
Journal of Global Optimization
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
Optimization Methods & Software - GLOBAL OPTIMIZATION
Hi-index | 0.00 |
Convex and concave envelopes play important roles in various types of optimization problems. In this article, we present a result that gives general guidelines for constructing convex and concave envelopes of functions of two variables on bounded quadrilaterals. We show how one can use this result to construct convex and concave envelopes of bilinear and fractional functions on rectangles, parallelograms and trapezoids. Applications of these results to global optimization are indicated.