Linear programming is the standard tool for constructing solutions to linear inverse problems which have the smallest possible maximum absolute value, or uniform norm. For problems in three dimensions, however, the tableaus are usually so large as to be computationally prohibitive. An iterative scheme can replace a single, very large linear programming tableau with a sequence of much smaller tableaus, making such problems tractable.

This content is PDF only. Please click on the PDF icon to access.

First Page Preview

First page PDF preview
You do not have access to this content, please speak to your institutional administrator if you feel you should have access.