The Bilinear Programming Problem is a structured quadratic programming problem whose objective function is, in general, neither convex nor concave. Making use of the formal linearity of a dual formulation of the problem, we give a necessary and sufficient condition for optimality, and an algorithm to find an optimal solution.
Bilinear programming: an exact algorithm
1977
Abstract
The Bilinear Programming Problem is a structured quadratic programming problem whose objective function is, in general, neither convex nor concave. Making use of the formal linearity of a dual formulation of the problem, we give a necessary and sufficient condition for optimality, and an algorithm to find an optimal solution.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_422442-doc_150212.pdf
solo utenti autorizzati
Descrizione: Bilinear programming: an exact algorithm
Tipologia:
Versione Editoriale (PDF)
Dimensione
2.06 MB
Formato
Adobe PDF
|
2.06 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
