Integer points in convex polyhedra
id:
integer-points-in-convex-polyhedra-186-16934851
title:
Integer points in convex polyhedra
text:
The study of integer points in convex polyhedra is motivated by questions such as "how many nonnegative integer-valued solutions does a system of linear equations with nonnegative coefficients have" or "how many solutions does an integer linear program have". Counting integer points in polyhedra or other questions about them arise in representation theory, commutative algebra, algebraic geometry, statistics, and computer science. The set of integer points, or, more generally, the set of points o
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Integer_points_in_convex_polyhedra
date created:
2009-12-03T15:42:10Z
date modified:
2024-09-08T12:55:49Z
main entity:
{"identifier":"Q6042594","url":"https://www.wikidata.org/entity/Q6042594"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/0/06/IP_polytope_with_LP_relaxation.svg","width":500,"height":415}
fields total:
13
integrity:
15