Pınar, M. Ç.2016-02-082016-02-0819961432-2994http://hdl.handle.net/11693/25732We use quadratic penalty functions along with some recent ideas from linear l1 estimation to arrive at a new characterization of primal optimal solutions in linear programs. The algorithmic implications of this analysis are studied, and a new, finite penalty algorithm for linear programming is designed. Preliminary computational results are presented.EnglishCharacterizationFinite algorithmsLinear l1 estimationLinear programmingQuadratic penalty functionsArticle10.1007/BF01193936