---
title: "relax and round"
type: concept
related: [Relax And Round]
source: https://www.jemoka.com/posts/kbhrelax_and_round/
confidence: high
status: active
---

In convex optimization, relax and round / polishing is a procedure by which you perform a local search after coming up with a relaxation, and round into the actual feasible set (such as integers).
