Convex programs with an additional constraint on the product of several convex functions

Convex programs with an additional constraint on the product of several convex functions

0.00 Avg rating0 Votes
Article ID: iaor1998948
Country: Netherlands
Volume: 77
Issue: 2
Start Page Number: 314
End Page Number: 324
Publication Date: Sep 1994
Journal: European Journal of Operational Research
Authors: , , ,
Abstract:

In this paper, we consider a special type of global optimization problem in which a convex function is minimized on X∩Y, where X is a convex set and Y is a nonconvex set represented in terms of a product of p convex functions. It is shown that this problem can be reduced to a p-dimensional reverse convex program. Two outer approximation algorithms are proposed for solving the resulting problem. Computational experiments indicate that these algorithms can generate ϵ-optimal solutions of fairly large scale linear programs with a constraint on the product of up to 4 linear functions.

Reviews

Required fields are marked *. Your email address will not be published.