Feasibility Discovery Test Evaluators
Feasibility-discovery test problems. These evaluators have no optimization objective — instead, the goal is to find feasible regions within the constraint boundaries.
- class DisconnectedFeasibleRegions
Bases:
TestEvaluatorA feasibility-only evaluator with multiple disconnected circular feasible islands.
Supports both a nonsmooth (exact min) and smooth (soft-min via log-sum-exp) formulation.
- Nonsmooth (smooth=False):
g1 = min over ℓ of [(x1 - a_ℓ)² + (x2 - b_ℓ)² - r_ℓ²]
- Smooth (smooth=True):
d_ℓ = (x1 - a_ℓ)² + (x2 - b_ℓ)² - r_ℓ² g1 = -τ · log(Σ_ℓ exp(-d_ℓ / τ))
A point is feasible when g1 <= 0.
Problem Description
A feasibility-only problem with multiple disconnected circular feasible islands. Supports both nonsmooth (exact min) and smooth (soft-min via log-sum-exp) formulations.
Problem Metadata
- Test Goal:
Feasibility
- Problem Type:
Continuous
- Variables:
2
- Continuous Variables:
2
- Discrete Variables:
0
- Constraints:
1
- Equality Constraints:
0
- Inequality Constraints:
1
- Bounded Variables:
Yes
- class SmallCircleFeasibleRegion
Bases:
TestEvaluatorA feasibility-only evaluator with a single circular constraint.
Points inside the circle centered at (a, b) with radius r are feasible. The constraint is defined as:
g1 = (x1 - a)^2 + (x2 - b)^2 - r^2
A point is feasible when g1 <= 0.
Problem Description
A feasibility-only problem with a single small circular feasible region. The constraint g1 = (x1-a)^2 + (x2-b)^2 - r^2 <= 0 defines a circle centered at (a, b) with radius r.
Problem Metadata
- Test Goal:
Feasibility
- Problem Type:
Continuous
- Variables:
2
- Continuous Variables:
2
- Discrete Variables:
0
- Constraints:
1
- Equality Constraints:
0
- Inequality Constraints:
1
- Bounded Variables:
Yes