Document Details

Document Type : Article In Journal 
Document Title :
An O ((m+n) Max {m+n, n3}) procedure for solving the linear programming problem
An O ((m+n) Max {m+n, n3}) procedure for solving the linear programming problem
 
Subject : Statistics 
Document Language : English 
Abstract : An iterative method based on conjugate gradient projection method (and not on any variant of Karmarkars algorithm) for solving linear programming problems is given. Our method consists of a sequence of moves: Starting with an initial interior point x0 our procedure finds a second feasible point x1 then a third point and so on until the optimal point is reached in at most m+n steps. A simple example is given to illustrate our method. © 2009, INSInet Publication. 
ISSN : 1816-157X 
Journal Name : Journal of Applied Sciences Research 
Volume : 5 
Issue Number : 4 
Publishing Year : 2009 AH
2009 AD 
Number Of Pages : 5 
Article Type : Article 
Added Date : Tuesday, October 13, 2009 

Researchers

Researcher Name (Arabic)Researcher Name (English)Researcher TypeDr GradeEmail
أحمد محمد أحمد حريريAhmed Mohamed Ahmed HaririResearcherDoctorateamahariri@hotmail.com
سعيد طنطاويTantawy, S.FResearcherDoctorate 

Files

File NameTypeDescription
 23404.pdf pdfAbstract

Back To Researches Page