In this paper a solution algorithm for a class of rank-two nonconvex programs having a polyhedral feasible region is proposed. The algorithm is based on the so called optimal level solutions method. Various global optimality conditions are discussed and implemented in order to improve the efficiency of the algorithm.

Global optimization of a rank-two nonconvex program

CAMBINI, RICCARDO;SODINI, CLAUDIO
2010-01-01

Abstract

In this paper a solution algorithm for a class of rank-two nonconvex programs having a polyhedral feasible region is proposed. The algorithm is based on the so called optimal level solutions method. Various global optimality conditions are discussed and implemented in order to improve the efficiency of the algorithm.
2010
Cambini, Riccardo; Sodini, Claudio
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/11568/137800
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 10
social impact