Novel Interior Point Algorithms for Solving Nonlinear Convex Optimization Problems

This paper proposes three numerical algorithms based on Karmarkar’s interior point technique for solvingnonlinear convex programming problems subject to linear constraints. The first algorithm uses the Karmarkaridea and linearization of the objective function. The second and third algorithms are mod...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Advances in Operations Research Jg. 2015; H. 2015; S. 59 - 65
Hauptverfasser:	Tahmasebzadeh, Sakineh, Malek, Alaeddin, Navidi, H. R.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Cairo, Egypt Hindawi Limiteds 01.01.2015 Hindawi Publishing Corporation John Wiley & Sons, Inc
Schlagworte:	Algorithms Analysis Convex programming Linear programming Mathematical optimization Methods Operations research Optimization Simplex method United States
ISSN:	1687-9147, 1687-9155
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!