Premium
A linear‐programming‐based method for determining whether or not n demand points are on a hemisphere
Author(s) -
Patel Minnie H.,
Nettles Deborah L.,
Deutsch Stuart J.
Publication year - 1993
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/1520-6750(199306)40:4<543::aid-nav3220400408>3.0.co;2-4
Subject(s) - minimax , linear programming , mathematical optimization , mathematics , computer science
Whenever n demand points are located on a hemisphere, spherical location problems can be solved easily using geometrical methods or mathematical programming. A method based on a linear programming formulation with four constraints is presented to determine whether n demand points are on a hemisphere. The formulation is derived from a modified minimax spherical location problem whose Karush‐Kuhn‐Tucker conditions are the constraints of the linear program. © 1993 John Wiley & Sons, Inc.