Piecewise-linear pathways to the optimal solution set in linear programming
dc.citation.epage | 634 | en_US |
dc.citation.issueNumber | 3 | en_US |
dc.citation.spage | 619 | en_US |
dc.citation.volumeNumber | 93 | en_US |
dc.contributor.author | Pınar, M. Ç. | en_US |
dc.date.accessioned | 2016-02-08T10:48:09Z | |
dc.date.available | 2016-02-08T10:48:09Z | |
dc.date.issued | 1997 | en_US |
dc.department | Department of Industrial Engineering | en_US |
dc.description.abstract | This paper takes a fresh look at the application of quadratic penalty functions to linear programming. Recently, Madsen et al. (Ref. 1) described a continuation algorithm for linear programming based on smoothing a dual l1-formulation of a linear program with unit bounds. The present paper is prompted by the observation that this is equivalent to applying a quadratic penalty function to the dual of a linear program in standard canonical form, in the sense that both approaches generate continuous, piecewise-linear paths leading to the optimal solution set. These paths lead to new characterizations of optimal solutions in linear programming. An important product of this analysis is a finite penalty algorithm for linear programming closely related to the least-norm algorithm of Mangasarian (Ref. 2) and to the continuation algorithm of Madsen et al. (Ref. 1). The algorithm is implemented, and promising numerical results are given. | en_US |
dc.identifier.doi | 10.1023/A:102265133 | en_US |
dc.identifier.issn | 0022-3239 | |
dc.identifier.uri | http://hdl.handle.net/11693/25627 | |
dc.language.iso | English | en_US |
dc.publisher | Kluwer Academic Publishers - Plenum Publishers | en_US |
dc.relation.isversionof | https://doi.org/10.1023/A:102265133 | en_US |
dc.source.title | Journal of Optimization Theory and Applications | en_US |
dc.subject | Characterization of optimal solutions | en_US |
dc.subject | Finiteness | en_US |
dc.subject | Linear programming | en_US |
dc.subject | Piece - wise - linear path - following algorithms | en_US |
dc.subject | Quadratic penalty functions | en_US |
dc.title | Piecewise-linear pathways to the optimal solution set in linear programming | en_US |
dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Piecewise-linear pathways to the optimal solution set in linear programming.pdf
- Size:
- 638.92 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version