Abstract
In [3, 1] gravitational methods for linear programming (LP) have been introduced. Several versions exist, the three main versions discussed there use a ball of (a): 0 radius, (b): small positive radius, and (c): the largest possible radius with the given center that will completely fit within the polytope, with the option of changing its radius as the algorithm progresses.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
