Package jline.opt.solver
Class BisectionSolver
java.lang.Object
jline.opt.solver.BisectionSolver
Exact O(log n) solver for a single integer decision variable with monotone
feasibility (the standard sizing pattern), an alternative to differential
evolution.
direction='min_feasible' finds the smallest feasible value
(server sizing); 'max_feasible' the largest (population sizing).
Mirrors native-Python line_solver.opt.sizing.BisectionSolver.-
Constructor Summary
ConstructorsConstructorDescriptionBisectionSolver(OptimizationProblem problem) BisectionSolver(OptimizationProblem problem, String direction) -
Method Summary
-
Constructor Details
-
BisectionSolver
-
BisectionSolver
-
-
Method Details
-
solve
-