Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
type: Item
instance of: scholarly article
title: Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
zbMATH Open document ID: 1264.90177
DOI: 10.1155/2012/376546
author: Antonio Roberto Balbo
author: Márcio Augusto Da Silva Souza
author: Edméa Cássia Baptista
author: Leonardo Nepomuceno
published in: Mathematical Problems in Engineering
publication date: 2013-06-11T00:00:00Z
review text: Summary: We propose a predictor-corrector primal-dual interior point method which introduces line search procedures (IPLS) in both the predictor and corrector steps. The Fibonacci search technique is used in the predictor step, while an Armijo line search is used in the corrector step. The method is developed for application to the economic dispatch (ED) problem studied in the field of power systems analysis. The theory of the method is examined for quadratic programming problems and involves the analysis of iterative schemes, computational implementation, and issues concerning the adaptation of the proposed algorithm to solve ED problems. Numerical results are presented, which demonstrate improvements and the efficiency of the IPLS method when compared to several other methods described in the literature. Finally, postoptimization analyses are performed for the solution of ED problems.
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6173235
Wikidata QID: Q58911504
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2012/376546
OpenAlex ID: W1974482340
cites work: A new polynomial-time algorithm for linear programming
cites work: Q5583564
cites work: A variation on Karmarkar’s algorithm for solving linear programming problems
cites work: A modification of Karmarkar's linear programming algorithm
cites work: An implementation of Karmarkar's algorithm for linear programming
cites work: Boundary Behavior of Interior Point Algorithms in Linear Programming
cites work: Q3996571
cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
cites work: Q5202843
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
cites work: Q3976517
cites work: Q3033554
cites work: Polynomial affine algorithms for linear programming
cites work: Interior path following primal-dual algorithms. I: Linear programming
cites work: A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
cites work: Q3491304
cites work: An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations
cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
cites work: Q3141920
cites work: Q3134873
cites work: Q5691079
description: scientific article; zbMATH DE number 6173235