Integer programming
Mathematical optimization problem in which variables are restricted to be integers
An integer programming, also known as integer optimization, problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear.
Nº Q6042592 ★★
Uncommon · Knowledge
Integer programming
Mathematical optimization problem in which variables are restricted to be integers
An integer programming, also known as integer optimization, problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear.
Last price
—
Floor price
—
7-day median
—
30-day sales
0
30-day range
—
In circulation
0
Price history
median
low – high
sales
No sales in this period
Show table
| Date | median | Low | High | sales |
|---|
Sales history
- Last sale
- —
- 30-day average
- —
- 30-day low
- —
- 30-day high
- —
- Sales 7d
- 0
- Sales 30d
- 0
No sales yet.
Anonymous sales: no buyer or seller shown. Figures count player-to-player sales only.
From Wikipedia
An integer programming, also known as integer optimization, problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. In many settings the term refers to integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is NP-complete (the difficult part is showing the NP membership). In particular, the special case of 0–1 integer linear programming, in which unknowns are binary, and only the restrictions must be satisfied, is one of Karp's 21 NP-complete problems. If some decision variables are not discrete, the problem is known as a mixed-integer programming problem.
Text: Wikipédia, CC BY-SA 4.0. · Image: Fanosta (CC BY-SA 4.0) ·
Related cards
Integer factorization
Decomposition of a number into a product
Nº Q4846249 ★★★
Constraint satisfaction problem
Mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations
Nº Q1128326 ★
Subset sum problem
Decision problem in computer science
Nº Q1154420 ★★
AMPL
Algebraic modeling language
Nº Q295250 ★
Lattice problem
Optimization problem in computer science
Nº Q6497128 ★
Dynamic programming
Problem optimization method that simplifies a complicated problem by decomposing it into simpler subproblems recursively
Nº Q380679 ★★★