spdspds

UNBELIEVABLE  O(L1.5)  WORST CASE  COMPUTATIONAL  COMPLEXITY  

ACHIEVED  BY  spdspds  ALGORITHM  FOR  

LINEAR  PROGRAMMING  PROBLEM  

width:93.5pt;height:93.5pt;z-index:1;visibility:visible;mso-wrap-style:square;
mso-wrap-distance-left:9pt;mso-wrap-distance-top:0;mso-wrap-distance-right:9pt;
mso-wrap-distance-bottom:0;mso-position-horizontal:absolute;
mso-position-horizontal-relative:text;mso-position-vertical:absolute;
mso-position-vertical-relative:text" wrapcoords="-347 0 -347 21138 21484 21138 21484 0 -347 0">

width:93.5pt;height:93.5pt;z-index:1;visibility:visible;mso-wrap-style:square;
mso-wrap-distance-left:9pt;mso-wrap-distance-top:0;mso-wrap-distance-right:9pt;
mso-wrap-distance-bottom:0;mso-position-horizontal:absolute;
mso-position-horizontal-relative:text;mso-position-vertical:absolute;
mso-position-vertical-relative:text" wrapcoords="-347 0 -347 21138 21484 21138 21484 0 -347 0">

width:93.5pt;height:93.5pt;z-index:1;visibility:visible;mso-wrap-style:square;
mso-wrap-distance-left:9pt;mso-wrap-distance-top:0;mso-wrap-distance-right:9pt;
mso-wrap-distance-bottom:0;mso-position-horizontal:absolute;
mso-position-horizontal-relative:text;mso-position-vertical:absolute;
mso-position-vertical-relative:text" wrapcoords="-347 0 -347 21138 21484 21138 21484 0 -347 0">

width:93.5pt;height:93.5pt;z-index:1;visibility:visible;mso-wrap-style:square;
mso-wrap-distance-left:9pt;mso-wrap-distance-top:0;mso-wrap-distance-right:9pt;
mso-wrap-distance-bottom:0;mso-position-horizontal:absolute;
mso-position-horizontal-relative:text;mso-position-vertical:absolute;
mso-position-vertical-relative:text" wrapcoords="-347 0 -347 21138 21484 21138 21484 0 -347 0">

Dr.(Prof.) Keshava Prasad Halemane, 

Professor - retired from

Department of Mathematical And Computational Sciences 

National Institute of Technology Karnataka, Surathkal 

Srinivasnagar, Mangalore – 575025, India. 

k.prasad.h@gmail.com [+919481022946] 

https://www.linkedin.com/in/keshavaprasadahalemane/ 

https://archive.org/details/@k_prasad_h 

Keywords:
optimization, linear programming, algorithm, simplex, symplex, symmetric primal dual symplex, spdspds, performance challenge, computational complexity 

AMS MSC Mathematics Subject Classification: 90C05 

ACM CCS Computing Classification System: F.2.1, G.1.6