Show simple item record

dc.contributor.authorPınar, M. Ç.en_US
dc.date.accessioned2016-02-08T10:49:42Z
dc.date.available2016-02-08T10:49:42Z
dc.date.issued1996en_US
dc.identifier.issn1432-2994
dc.identifier.urihttp://hdl.handle.net/11693/25732
dc.description.abstractWe 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.en_US
dc.language.isoEnglishen_US
dc.source.titleMathematical Methods of Operations Researchen_US
dc.relation.isversionofhttps://doi.org/10.1007/BF01193936en_US
dc.subjectCharacterizationen_US
dc.subjectFinite algorithmsen_US
dc.subjectLinear l1 estimationen_US
dc.subjectLinear programmingen_US
dc.subjectQuadratic penalty functionsen_US
dc.titleLinear programming via a quadratic penalty functionen_US
dc.typeArticleen_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.citation.spage345en_US
dc.citation.epage370en_US
dc.citation.volumeNumber44en_US
dc.citation.issueNumber3en_US
dc.identifier.doi10.1007/BF01193936en_US
dc.publisherPhysica - Verlagen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record