Journal
MATHEMATICAL PROGRAMMING
Volume 144, Issue 1-2, Pages 65-91Publisher
SPRINGER HEIDELBERG
DOI: 10.1007/s10107-012-0616-x
Keywords
Convex envelopes; Semidefinite programming; Quadratic problems; Fractional problems
Ask authors/readers for more resources
In this paper we discuss convex envelopes for bivariate functions, satisfying suitable assumptions, over polytopes. We first propose a technique to compute the value and a supporting hyperplane of the convex envelope over a general two-dimensional polytope through the solution of a three-dimensional convex subproblem with continuously differentiable constraint functions. Then, for quadratic functions as well as for some polynomial and rational ones, again satisfying suitable assumptions, we show how the same computations can be carried out through the solution of a single semidefinite problem.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available