| Article ID: | iaor2003735 |
| Country: | Germany |
| Volume: | 91 |
| Issue: | 1 |
| Start Page Number: | 127 |
| End Page Number: | 144 |
| Publication Date: | Jan 2001 |
| Journal: | Mathematical Programming |
| Authors: | Kortanek K.O., Zhang Q. |
| Keywords: | duality |
This paper develops new relationships between the recently constructed semidefinite programming perfect duality and the earlier perfect duality achieved for linear semi-infinite programming. Applying the linear semi-infinite perfect duality construction to semidefinite programming yields a larger feasible set than the one obtained by the newly constructed semidefinite programming regularized perfect dual.