Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with lp-relaxation
Search options not deleted
user 15254
For questions relating to the relaxation of linear integer or mixed-integer-linear programming (MILP) problems where the integer constraints are removed.
5
votes
1
answer
86
views
How to find costs to an integer program that maximize integrality gap
Let $A \in \mathbb{Z}^{m \times n}$ and $b \in \mathbb{Z}^m$. For $c \in \mathbb{R}^n$, let
\begin{align} \text{ILP}(c) = \max \quad & c^\top x \\ \text{s.t.} \quad & x \in \mathbb{Z}^n \\ & A x \leq …
- 51