In a previous work we examined some active constraints methods for the computation of the projection of a pointi onto a polyhedron when a feasible point is known. In this paper, we assume that such a point is not known, and examine a method similar to the Big-M method developed for the solution of linear programming problems. Special attention is given to the study of computing error propagation.
A BIG-M type method for the computation of projections onto polyhedrons
1983
Abstract
In a previous work we examined some active constraints methods for the computation of the projection of a pointi onto a polyhedron when a feasible point is known. In this paper, we assume that such a point is not known, and examine a method similar to the Big-M method developed for the solution of linear programming problems. Special attention is given to the study of computing error propagation.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_420895-doc_149298.pdf
accesso aperto
Descrizione: A BIG-M type method for the computation of projections onto polyhedrons
Dimensione
2.77 MB
Formato
Adobe PDF
|
2.77 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
