Izvorni znanstveni članak
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
Sažetak
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.
Ključne riječi
sequential linear programming; smallest circumscribed; largest inscribed; minimum zone
Hrčak ID:
833
URI
Datum izdavanja:
20.6.2001.
Posjeta: 2.093 *