From: stevenj <stevenj@alum.mit.edu>
Date: Wed, 29 Aug 2007 23:49:28 +0000 (-0400)
Subject: K can be arbitrarily large for rightmost point in hull
X-Git-Url: http://www.chiark.greenend.org.uk/ucgi/~ianmdlvl/git?a=commitdiff_plain;h=de53cb9789b9893b5bb08968297932bb01439f2b;p=nlopt.git

K can be arbitrarily large for rightmost point in hull

darcs-hash:20070829234928-c8de0-b0128297e8ddf4c7e169cf2569e7200d55e36572.gz
---

diff --git a/cdirect/cdirect.c b/cdirect/cdirect.c
index aa21b96..9d95f8f 100644
--- a/cdirect/cdirect.c
+++ b/cdirect/cdirect.c
@@ -376,7 +376,7 @@ static nlopt_result divide_good_rects(params *p)
 	       K1 = (hull[i][1] - hull[ip][1]) / (hull[i][0] - hull[ip][0]);
 	  K = MAX(K1, K2);
 	  if (hull[i][1] - K * hull[i][0]
-	      <= p->fmin - magic_eps * fabs(p->fmin)) {
+	      <= p->fmin - magic_eps * fabs(p->fmin) || ip == nhull) {
 	       /* "potentially optimal" rectangle, so subdivide */
 	       nlopt_result ret = divide_rect(hull[i], p);
 	       divided_some = 1;