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...

Full description

Bibliographic Details

Published in:	Advances in Operations Research Vol. 2015; no. 2015; pp. 59 - 65
Main Authors:	Tahmasebzadeh, Sakineh, Malek, Alaeddin, Navidi, H. R.
Format:	Journal Article
Language:	English
Published:	Cairo, Egypt Hindawi Limiteds 01.01.2015 Hindawi Publishing Corporation John Wiley & Sons, Inc
Subjects:	Algorithms Analysis Convex programming Linear programming Mathematical optimization Methods Operations research Optimization Simplex method United States
ISSN:	1687-9147, 1687-9155
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!