A Modified Gradient Procedure for Multifacility Euclidean Distance Location Problems

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 539
  • Download : 442
An efficient heuristic solution procedure is developed for the minimum location problems. The gradient direction method and modified gradient approach are developed due to the differentiability of the objective functions. Suboptimal step size is obtained analytically. A Modified Gradient Procedure (MGP) is presented and compared with the hyperboloid approximation procedure (HAP) which is one of the best known methods.
Publisher
한국경영과학회
Issue Date
1988-12
Language
Korean
Citation

한국경영과학회지, v.13, no.2, pp.25 - 33

ISSN
1225-1119
URI
http://hdl.handle.net/10203/23542
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0