Does the whole segment stay feasible?
BeginnerOPT 01 · Modeling Decisions and Convex SetsInteractive plot
Description
Place two feasible points on a circle, slide along the segment between them, and compare a disk with an annulus.
Try this: Choose the annulus and place both endpoints on the circle. Find two endpoints whose whole segment stays feasible, and two whose segment crosses the hole. How far apart in angle do they need to be?
Explanation
Answer the prediction first, or open the explanation when you are ready.
Show the explanation
The midpoint of a chord at angle difference Δ lies at distance 0.85·cos(Δ/2) from the center. That drops below 0.5 once Δ exceeds about 108 degrees, so the segment crosses the hole although both ends are feasible: the annulus is not convex. For the disk this never happens.
Lab · Does the whole segment stay feasible?
- Radius at weight λ
- 0.291
- Smallest radius on the segment
- 0.291
- Angle apart (degrees)
- 140
The chosen point lies in the hole although both endpoints are feasible: the annulus is not convex.
Try this: Choose the annulus and place both endpoints on the circle. Find two endpoints whose whole segment stays feasible, and two whose segment crosses the hole. How far apart in angle do they need to be?
Endpoints are P = 0.85(cos α, sin α) and Q = 0.85(cos β, sin β). The disk has radius 1; the annulus also requires radius ≥ 0.5. The segment is x(λ) = (1−λ)P + λQ. One counterexample disproves convexity; sampled examples alone do not prove it.