Abstract
Newly proposed ellipsoid algorithms provide considerable hope for advancing the relevance of mathematical programming applications. They are extremely suitalbe for multiobjective programming, goal programming and interactive programming methodologies. More intimate cooperation between the decision maker and a model of his problem is likely to be enhanced. In this short article the basic ideas of ellipsoid algorithms and views of their potential applicability are communicated.
Keywords
Get full access to this article
View all access options for this article.