Feasible region
id:
feasible-region-286-4171635
title:
Feasible region
text:
In mathematical optimization and computer science, a feasible region, feasible set, or solution space is the set of all possible points (sets of values of the choice variables) of an optimization problem that satisfy the problem's constraints, potentially including inequalities, equalities, and integer constraints. This is the initial set of candidate solutions to the problem, before the set of candidates has been narrowed down. For example, consider the problem of minimizing the function x 2 +
brand slug:
wiki
category slug:
encyclopedia
description:
Mathematical constraints that define ways of finding the best solution
original url:
https://en.wikipedia.org/wiki/Feasible_region
date created:
date modified:
2024-03-28T19:13:01Z
main entity:
{"identifier":"Q17013331","url":"https://www.wikidata.org/entity/Q17013331"}
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