@@ -32,7 +32,8 @@ void call_test_max_ball() {
32
32
33
33
std::cout << " \n --- Testing Chebychev ball for skinny H-polytope" << std::endl;
34
34
bool pre_rounding = true ; // round random polytope before applying the skinny transformation
35
- P = skinny_random_hpoly<Hpolytope, NT, PolyRNGType>(4 , 180 , pre_rounding, 2000.0 , 127 );
35
+ NT max_min_eig_ratio = NT (2000 );
36
+ P = skinny_random_hpoly<Hpolytope, NT, PolyRNGType>(4 , 180 , pre_rounding, max_min_eig_ratio, 127 );
36
37
P.normalize ();
37
38
std::pair<Point, NT> InnerBall = P.ComputeInnerBall ();
38
39
@@ -55,7 +56,8 @@ void call_test_max_ball_feasibility() {
55
56
56
57
std::cout << " \n --- Testing feasibility point for skinny H-polytope" << std::endl;
57
58
bool pre_rounding = true ; // round random polytope before applying the skinny transformation
58
- P = skinny_random_hpoly<Hpolytope, NT, PolyRNGType>(50 , 500 , pre_rounding, 2000.0 , 127 );
59
+ NT max_min_eig_ratio = NT (2000 );
60
+ P = skinny_random_hpoly<Hpolytope, NT, PolyRNGType>(50 , 500 , pre_rounding, max_min_eig_ratio, 127 );
59
61
P.normalize ();
60
62
61
63
bool feasibility_only = true ; // compute only a feasible point
@@ -79,7 +81,8 @@ void call_test_analytic_center() {
79
81
80
82
std::cout << " \n --- Testing analytic center for skinny H-polytope" << std::endl;
81
83
bool pre_rounding = true ; // round random polytope before applying the skinny transformation
82
- P = skinny_random_hpoly<Hpolytope, NT, PolyRNGType>(3 , 15 , pre_rounding, 100.0 , 127 );
84
+ NT max_min_eig_ratio = NT (100 );
85
+ P = skinny_random_hpoly<Hpolytope, NT, PolyRNGType>(3 , 15 , pre_rounding, max_min_eig_ratio, 127 );
83
86
P.normalize ();
84
87
85
88
auto [analytic_center, converged] = analytic_center_linear_ineq<MT, VT, NT>(P.get_mat (), P.get_vec ());
@@ -101,4 +104,4 @@ TEST_CASE("test_feasibility_point") {
101
104
102
105
TEST_CASE (" test_analytic_center" ) {
103
106
call_test_analytic_center<double >();
104
- }
107
+ }
0 commit comments