An interior point method for linear programming
From MaRDI portal
DOI10.1017/S033427000000672XzbMATH Open0704.90063OpenAlexW2165061797MaRDI QIDQ3484625FDOQ3484625
Authors: Michael R. Osborne 
Publication date: 1990
Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s033427000000672x
Recommendations
Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Cited In (49)
- An interior point technique for solving bilevel programming problems
- INTERIOR POINT METHOD FOR SOLVING LINEAR PROGRAMMING WITH INTERVAL COEFFICIENTS USING AFFINE SCALING
- On the equivalence of the simplex methods and a multiplier-alike method for linear programming
- Solving linear systems in interior-point methods
- Integrability of vector and multivector fields associated with interior point methods for linear programming
- An interior-point algorithm for solving inverse linear optimization problem
- A polynomial method of approximate centers for linear programming
- On the finite convergence of interior-point algorithms for linear programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- An Interior Point Method for Bordered Block-Diagonal Linear Programs
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- Title not available (Why is that?)
- Feasible region contraction interior point algorithm
- Determination of an interior feasible point for a system of linear constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementing cholesky factorization for interior point methods of linear programming
- On a class of interior point algorithms
- Interior point methods of mathematical programming
- PCx: an interior-point code for linear programming
- A multiplicative barrier function method for linear programming
- A regularized interior-point method for constrained linear least squares
- Title not available (Why is that?)
- A still simpler way of introducing interior-point method for linear programming
- Interior point algorithm for linear programming problem and related inscribed ellipsoids
- A boundary-point LP solution method and its application to dense linear programs
- Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving a linear multiperiod portfolio problem by interior-point methodology
- On interior algorithms for linear programming with no regularity assumptions
- An Interior-Point Algorithm for Linearly Constrained Optimization
- On first experiences with the implementation of a Newton based linear programming approach
- A Low Complexity Interior-Point Algorithm for Linear Programming
- An estimate of Lagrange multipliers for linear programming using interior point methods
- Optimized choice of parameters in interior-point methods for linear programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Numerical inclusion of optimum point for linear programming
- Interior point methods for large-scale linear programming
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- An interior linearization method
- Title not available (Why is that?)
- A variation on the interior point method for linear programming using the continued iteration
- Title not available (Why is that?)
This page was built for publication: An interior point method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3484625)
