logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

A PURIFICATION ALGORITHM FOR SEMI-INFINITE PROGRAMMING

delete1992-03-01
delete9
PRE
AI
T
Teresa León *
E
Enriqueta Vercher
DOI：10.1016/0377-2217(92)90353-Bdelete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper we present a purification algorithm for semi-infinite linear programming. Starting with a feasible point, the algorithm either finds an improved extreme point or concludes with the unboundedness of the problem. The method is based on the solution of a sequence of linear programming problems. The study of some recession conditions has allowed us to establish a weak assumption for the finite convergence of this algorithm. Numerical results illustrating the method are given.
Keywords:
LINEAR PROGRAMMING
SEMI-INFINITE PROGRAMS
RECESSION CONDITIONS
GRADIENT METHODS

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

No organization information available