Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Pey-Chun Chen"'
Publikováno v:
Journal of Regional Science. Nov92, Vol. 32 Issue 4, p467. 20p.
Publikováno v:
Operations Research. 46:548-562
D.-c. programming is a recent technique of global optimization that allows the solution of problems whose objective function and constraints can be expressed as differences of convex (i.e., d.-c.) functions. Many such problems arise in continuous loc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1b6c056a01a1ba6142d784b12d997192
https://doi.org/10.1287/opre.46.4.548
https://doi.org/10.1287/opre.46.4.548
Publikováno v:
Journal of Regional Science. 32:467-486
Weber's problem consists of locating a facility in the plane in such a way that the weighted sum of Euclidean distances to n given points be minimum. The case where some weights are positive and some are negative is shown to be a d.-c. program (i.e.,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e049f0431a3d39230b85e99db120ed43
https://doi.org/10.1111/j.1467-9787.1992.tb00200.x
https://doi.org/10.1111/j.1467-9787.1992.tb00200.x
Publikováno v:
Operations Research Letters. 10:403-409
We propose a new algorithm to solve the on-line vertex enumeration problem for polytopes, doing all computations in n-space, where n is the dimension of the polytope. This algorithm exploits adjacency lists between vertices and uses no simplex tablea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::21626c083dd04553e2973f98893a316e
https://doi.org/10.1016/0167-6377(91)90042-n
https://doi.org/10.1016/0167-6377(91)90042-n