Formulating Two-Stage Stochastic Programs for Interior Point Methods
Data up to Jan 2025
Total Citations Per Year
Abstract
References (17)
A new polynomial-time algorithm for linear programming
1984 • 4,898 citations
Scenarios and Policy Aggregation in Optimization Under Uncertainty
1991 • 1,280 citations
Interior path following primal-dual algorithms. part I: Linear programming
1989 • 482 citations
On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
1986 • 439 citations
An implementation of Karmarkar's algorithm for linear programming
1989 • 424 citations
A modification of karmarkar's linear programming algorithm
1986 • 358 citations
A variation on Karmarkar’s algorithm for solving linear programming problems
1986 • 332 citations
Computational experience with a primal-dual interior point method for linear programming
1991 • 317 citations
An Implementation of a Primal-Dual Interior Point Method for Linear Programming
1989 • 210 citations
Interior path following primal-dual algorithms
1988 • 163 citations
Stochastic network optimization models for investment planning
1989 • 128 citations
Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
1989 • 98 citations
The Aggregation Principle in Scenario Analysis and Stochastic Optimization
1989 • 83 citations
Solving multistage stochastic networks: An application of scenario aggregation
1991 • 68 citations
Further Development of a Primal-Dual Interior Point Method
1990 • 67 citations
An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of Convergence
1990 • 62 citations
Regularized Decomposition and Augmented Lagrangian Decomposition for Angular Linear Programming Problems
1989 • 13 citations