Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis

DOI10.1155/2012/376546zbMath1264.90177OpenAlexW1974482340WikidataQ58911504 ScholiaQ58911504MaRDI QIDQ1954726

Márcio Augusto Da Silva Souza, Antonio Roberto Balbo, Leonardo Nepomuceno, Edméa Cássia Baptista

Publication date: 11 June 2013

Published in: Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2012/376546

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Production models (90B30) Interior-point methods (90C51)

Cites Work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• Polynomial affine algorithms for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
• An Algorithm for Convex Quadratic Programming That Requires O(n^3.5L) Arithmetic Operations
• Boundary Behavior of Interior Point Algorithms in Linear Programming
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis