Binary Integer Programming Task: Difference between revisions
Jump to navigation
Jump to search
m (Text replacement - "** ..." to "** …") |
m (Text replacement - ". ---- " to ". ---- ") |
||
| Line 7: | Line 7: | ||
** a [[Mixed Integer Programming Task]]. | ** a [[Mixed Integer Programming Task]]. | ||
* <B>See:</B> [[Basic Income Program]], [[Linear Programming Task]]. | * <B>See:</B> [[Basic Income Program]], [[Linear Programming Task]]. | ||
---- | ---- | ||
---- | ---- | ||
Latest revision as of 22:10, 16 June 2021
A Binary Integer Programming Task is an Integer Linear Programming Task whose Hidden Variables are Binary Variables.
- AKA: 0-1 Integer Program, Binary Integer Program, BIP.
- Context:
- Counter-Example(s):
- See: Basic Income Program, Linear Programming Task.
References
1998
- M. Cecilia Bastarrica, Alexander A. Shvartsman, and Steven A. Demurjian. (1998). “A Binary Integer Programming Model for Optimal Object Distribution.” In: OPODIS.