Linear programming via a quadratic penalty function
dc.citation.epage | 370 | en_US |
dc.citation.issueNumber | 3 | en_US |
dc.citation.spage | 345 | en_US |
dc.citation.volumeNumber | 44 | en_US |
dc.contributor.author | Pınar, M. Ç. | en_US |
dc.date.accessioned | 2016-02-08T10:49:42Z | |
dc.date.available | 2016-02-08T10:49:42Z | |
dc.date.issued | 1996 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | We 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.description.provenance | Made available in DSpace on 2016-02-08T10:49:42Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 1996 | en |
dc.identifier.doi | 10.1007/BF01193936 | en_US |
dc.identifier.issn | 1432-2994 | |
dc.identifier.uri | http://hdl.handle.net/11693/25732 | |
dc.language.iso | English | en_US |
dc.publisher | Physica - Verlag | en_US |
dc.relation.isversionof | https://doi.org/10.1007/BF01193936 | en_US |
dc.source.title | Mathematical Methods of Operations Research | en_US |
dc.subject | Characterization | en_US |
dc.subject | Finite algorithms | en_US |
dc.subject | Linear l1 estimation | en_US |
dc.subject | Linear programming | en_US |
dc.subject | Quadratic penalty functions | en_US |
dc.title | Linear programming via a quadratic penalty function | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Linear programming via a quadratic penalty function.pdf
- Size:
- 963.66 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version