Original scientific paper

On a sequential linear programming approach to finding the smallest circumscribed, largest inscribed, and minimum zone circle or sphere

H. Späth
G. A. Watson

Abstract

Sequential linear programming methods have been successfully
used to solve some sphere and circle problems. Indeed, empirical evidence shows that these frequently find the required solutions in one step. An analysis is presented here which attempts to give an explanation of this phenomemon.

Keywords

sequential linear programming; smallest circumscribed; largest inscribed; minimum zone

Hrčak ID:

833

URI

https://hrcak.srce.hr/833

Publication date:

20.6.2001.

Visits: 2.093 *