# balazon/ClosestPointLinearConstraints

> Finds the closest point to a defined P point that fulfills linear constraints (inequalities, like 2x - 3y < 2.3), if there is such a point. The constraints, and the P point is all in 2D. This is a special case of the convex optimization problem called quadratic programming

- **Canonical URL**: https://githubrepo.cloud/repo/balazon/ClosestPointLinearConstraints
- **GitHub Repository**: https://github.com/balazon/ClosestPointLinearConstraints
- **Maintainer / Creator**: https://github.com/balazon
- **Discovered On**: Oct 17, 2026

---
*Indexed by GitHubRepo (https://githubrepo.cloud). Real-time open-source discovery & telemetry.*