Efficient solution of two-stage stochastic linear programs using interior point methods (Q1803648): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(12 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: John R. Birge / rank
Normal rank
 
Property / author
 
Property / author: Derek F. Holmes / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Vlasta Kaňková / rank
Normal rank
 
Property / author
 
Property / author: John R. Birge / rank
 
Normal rank
Property / author
 
Property / author: Derek F. Holmes / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Vlasta Kaňková / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LINPACK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PVM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: KORBX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINOS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SPARSPAK / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: YSMP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OSL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3229784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prior reduced fill-in in solving equations in interior point algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Development of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3288565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A set of staircase linear programming test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solution Method for Multistage Stochastic Programs with Recourse with Application to an Energy Investment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating Two-Stage Stochastic Programs for Interior Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a dual affine variant of Karmarkar's method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic network optimization models for investment planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified view of interior point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric indefinite systems for interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf00249637 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022985590 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:53, 30 July 2024

scientific article
Language Label Description Also known as
English
Efficient solution of two-stage stochastic linear programs using interior point methods
scientific article

    Statements

    Efficient solution of two-stage stochastic linear programs using interior point methods (English)
    0 references
    29 June 1993
    0 references
    Stochastic programming problems with fixed recourse and a finite support of the probability measure are considered. It is well-known that such problems are (from the mathematical point of view) equivalent to linear programming problems of a rather greater dimension and consequently they can be solved by interior point methods. In the literature, this type of methods have been already modified for the above mentioned problems. The aim of the paper is to compare these modifications. To this end, first, the modifications are introduced. Furthermore, a great attention is devoted to the computational experience. At the end of the paper a discussion to the applications is presented.
    0 references
    fixed recourse
    0 references
    interior point methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references