Global optimization problem with multiple reverse convex constraints and its application to out-of-roundness problem

Global optimization problem with multiple reverse convex constraints and its application to out-of-roundness problem

0.00 Avg rating—0 Votes
Article ID: iaor19971588
Country: Japan
Volume: 39
Issue: 3
Start Page Number: 356
End Page Number: 371
Publication Date: Sep 1996
Journal: Journal of the Operations Research Society of Japan
Authors: , ,
Keywords: programming: geometric, programming: mathematical
Abstract:

The authors consider a global minimization problem: equ1, where X and Y are polytopes in equ2 and equ3, respectively; F is a closed convex set in equ4; and equ5 is an open convex set in equ6. They propose an algorithm based on a combination of polyhedral outer approximation, branch-and-bound and cutting plane techniques. The authors also show that the out-of-roundness problem can be solved by the algorithm.

Reviews

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