In this paper we discuss optimality-based domain reductions for Global Optimization problems both from the theoretical and from the computational point of view. When applying an optimality-based domain reduction we can easily define a lower limit for the reduction which can be attained, but we can hardly guarantee that such limit is reached. Here, we theoretically prove that, for a nontrivial class of problems, appropriate strategies exist that are always able to reach this lower limit. On the other hand, we will also show that the same strategies lose this property as soon as we slightly enlarge the class of problems. Next, we perform computational experiments with a standard B&B approach applied to Linear Multiplicative Programming problems. We aim at establishing a good trade off between the quality of the domain reduction (the higher the quality, the lower the number of nodes in the B&B tree), and the computational cost of the domain reduction, and, thus, the effort per node of the B&B tree.

Theoretical and computational results about optimality-based domain reductions / Caprara, Alberto; Locatelli, Marco; Monaci, Michele. - In: COMPUTATIONAL OPTIMIZATION AND APPLICATIONS. - ISSN 0926-6003. - 64:2(2016), pp. 1-21. [10.1007/s10589-015-9818-5]

Theoretical and computational results about optimality-based domain reductions

CAPRARA, Alberto;LOCATELLI, Marco;
2016-01-01

Abstract

In this paper we discuss optimality-based domain reductions for Global Optimization problems both from the theoretical and from the computational point of view. When applying an optimality-based domain reduction we can easily define a lower limit for the reduction which can be attained, but we can hardly guarantee that such limit is reached. Here, we theoretically prove that, for a nontrivial class of problems, appropriate strategies exist that are always able to reach this lower limit. On the other hand, we will also show that the same strategies lose this property as soon as we slightly enlarge the class of problems. Next, we perform computational experiments with a standard B&B approach applied to Linear Multiplicative Programming problems. We aim at establishing a good trade off between the quality of the domain reduction (the higher the quality, the lower the number of nodes in the B&B tree), and the computational cost of the domain reduction, and, thus, the effort per node of the B&B tree.
2016
Theoretical and computational results about optimality-based domain reductions / Caprara, Alberto; Locatelli, Marco; Monaci, Michele. - In: COMPUTATIONAL OPTIMIZATION AND APPLICATIONS. - ISSN 0926-6003. - 64:2(2016), pp. 1-21. [10.1007/s10589-015-9818-5]
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11381/2807903
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 6
  • ???jsp.display-item.citation.isi??? 5
social impact