The Four-Block Model Matching Problem in $l^1 $ and Infinite-Dimensional Linear Programming
The purpose of this work is fourfold. First the reader is introduced to the present state of the theory behind the solution of the general model matching problem in $l^1 $. This solution is based on the fact that the model matching problem can be recast as an infinite-dimensional linear programming...
Saved in:
| Published in: | SIAM journal on control and optimization Vol. 31; no. 3; pp. 747 - 779 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Philadelphia
Society for Industrial and Applied Mathematics
01.05.1993
|
| Subjects: | |
| ISSN: | 0363-0129, 1095-7138 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!