Bounded Dual Simplex Algorithm: Definition and Structure

Detalhes bibliográficos
Autor(a) principal: Garcés, L. P.
Data de Publicação: 2013
Outros Autores: Gallego, L. A. [UNESP], Romero, R. [UNESP]
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.1007/978-3-642-30504-7_2
http://hdl.handle.net/11449/219938
Resumo: This chapter presents the Bounded Dual Simplex Algorithm, which is one of the most frequently used linear programming algorithms for solving real-world problems. A solution structure of the bounded dual simplex method (used to solve linear programming problems) is presented. The main advantage of this algorithm is its use in finding solutions for large-scale problems, and its robustness and efficiency are identified in this chapter. One application of this algorithm in the area of electrical engineering is provided: namely, solving the transmission network expansion planning where the normal operation conditions of the system are continually evaluated by solving linear programming problems. The method is explained step-by-step, so that the methodology can be adapted to other problems. Finally, some conclusions are drawn. © Springer-Verlag Berlin Heidelberg 2013.
id UNSP_6e5bbcf2fa8cfee6ca749e43b2f0b479
oai_identifier_str oai:repositorio.unesp.br:11449/219938
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Bounded Dual Simplex Algorithm: Definition and StructureBounded dual simplexDuality theoryLinear optimizationSimplex algorithmThis chapter presents the Bounded Dual Simplex Algorithm, which is one of the most frequently used linear programming algorithms for solving real-world problems. A solution structure of the bounded dual simplex method (used to solve linear programming problems) is presented. The main advantage of this algorithm is its use in finding solutions for large-scale problems, and its robustness and efficiency are identified in this chapter. One application of this algorithm in the area of electrical engineering is provided: namely, solving the transmission network expansion planning where the normal operation conditions of the system are continually evaluated by solving linear programming problems. The method is explained step-by-step, so that the methodology can be adapted to other problems. Finally, some conclusions are drawn. © Springer-Verlag Berlin Heidelberg 2013.Federal University of ABC, São PauloPaulista State University, Ilha SolteiraPaulista State University, Ilha SolteiraFederal University of ABCUniversidade Estadual Paulista (UNESP)Garcés, L. P.Gallego, L. A. [UNESP]Romero, R. [UNESP]2022-04-28T18:58:33Z2022-04-28T18:58:33Z2013-10-18info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/article29-50http://dx.doi.org/10.1007/978-3-642-30504-7_2Intelligent Systems Reference Library, v. 38, p. 29-50.1868-43941868-4408http://hdl.handle.net/11449/21993810.1007/978-3-642-30504-7_22-s2.0-84885451728Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengIntelligent Systems Reference Libraryinfo:eu-repo/semantics/openAccess2022-04-28T18:58:34Zoai:repositorio.unesp.br:11449/219938Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-28T18:58:34Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Bounded Dual Simplex Algorithm: Definition and Structure
title Bounded Dual Simplex Algorithm: Definition and Structure
spellingShingle Bounded Dual Simplex Algorithm: Definition and Structure
Garcés, L. P.
Bounded dual simplex
Duality theory
Linear optimization
Simplex algorithm
title_short Bounded Dual Simplex Algorithm: Definition and Structure
title_full Bounded Dual Simplex Algorithm: Definition and Structure
title_fullStr Bounded Dual Simplex Algorithm: Definition and Structure
title_full_unstemmed Bounded Dual Simplex Algorithm: Definition and Structure
title_sort Bounded Dual Simplex Algorithm: Definition and Structure
author Garcés, L. P.
author_facet Garcés, L. P.
Gallego, L. A. [UNESP]
Romero, R. [UNESP]
author_role author
author2 Gallego, L. A. [UNESP]
Romero, R. [UNESP]
author2_role author
author
dc.contributor.none.fl_str_mv Federal University of ABC
Universidade Estadual Paulista (UNESP)
dc.contributor.author.fl_str_mv Garcés, L. P.
Gallego, L. A. [UNESP]
Romero, R. [UNESP]
dc.subject.por.fl_str_mv Bounded dual simplex
Duality theory
Linear optimization
Simplex algorithm
topic Bounded dual simplex
Duality theory
Linear optimization
Simplex algorithm
description This chapter presents the Bounded Dual Simplex Algorithm, which is one of the most frequently used linear programming algorithms for solving real-world problems. A solution structure of the bounded dual simplex method (used to solve linear programming problems) is presented. The main advantage of this algorithm is its use in finding solutions for large-scale problems, and its robustness and efficiency are identified in this chapter. One application of this algorithm in the area of electrical engineering is provided: namely, solving the transmission network expansion planning where the normal operation conditions of the system are continually evaluated by solving linear programming problems. The method is explained step-by-step, so that the methodology can be adapted to other problems. Finally, some conclusions are drawn. © Springer-Verlag Berlin Heidelberg 2013.
publishDate 2013
dc.date.none.fl_str_mv 2013-10-18
2022-04-28T18:58:33Z
2022-04-28T18:58:33Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.1007/978-3-642-30504-7_2
Intelligent Systems Reference Library, v. 38, p. 29-50.
1868-4394
1868-4408
http://hdl.handle.net/11449/219938
10.1007/978-3-642-30504-7_2
2-s2.0-84885451728
url http://dx.doi.org/10.1007/978-3-642-30504-7_2
http://hdl.handle.net/11449/219938
identifier_str_mv Intelligent Systems Reference Library, v. 38, p. 29-50.
1868-4394
1868-4408
10.1007/978-3-642-30504-7_2
2-s2.0-84885451728
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Intelligent Systems Reference Library
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 29-50
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1803649803466309632

Registros relacionados