Tools
Tools
Chebotarev, S. (1977). On the Use of Matrix Factorization Techniques in Penalty Function Methods for Structured Linear Programs. IIASA Research Memorandum. IIASA, Laxenburg, Austria: RM-77-021
Preview |
Text
RM-77-021.pdf Download (639kB) | Preview |
Abstract
An algorithm converging to an optimal solution of a linear program in a finite number of steps is proposed. The algorithm is based on the use of smooth penalty functions as well as on matrix factorization techniques. It consists of finding corner points of the piece-wise linear unconstrained minima trajectory.
The application of the algorithm to dynamic linear programs and block-angular programs is described.
| Item Type: | Monograph (IIASA Research Memorandum) |
|---|---|
| Research Programs: | System and Decision Sciences - Core (SDS) |
| Depositing User: | IIASA Import |
| Date Deposited: | 15 Jan 2016 01:44 |
| Last Modified: | 27 Aug 2021 17:08 |
| URI: | https://pure.iiasa.ac.at/794 |
Actions (login required)
 |
View Item |