Minimizing the sum of a convex function and the product of two affine functions over a convex set

1 January 1992

journal article
research article
Published by Taylor & Francis in Optimization

Vol. 24 (1-2) , 57-62
https://doi.org/10.1080/02331939208843779

Abstract

An efficient branch-and-bound algorithm for minimizing the sum of a convex function and the product of two affine functions over a convex set is proposed. The branching takes place in an interval of R the bounding is a relaxation

Keywords

PRODUCT OF TWO AFFINE FUNCTIONS
GLOBAL OPTIMIZATION
BRANCH-AND-BOUND ALGORITHM
NUMERICAL EFFICIENCY

This publication has 3 references indexed in Scilit:

A Collection of Test Problems for Constrained Global Optimization Algorithms
Published by Springer Nature ,1990
On finding Most Optimal Rectangular Package Plans
Published by Institute of Electrical and Electronics Engineers (IEEE) ,1982
Solving Bicriterion Mathematical Programs
Operations Research, 1967