Feasible region
In mathematical optimization, a feasible region, feasible set, search space, 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 Minimize with respect to the variables and subject to and Constraint satisfaction is the process of finding a point in the feasible region.
Wikipage disambiguates
Active-set methodAffine scalingAnd–or treeArchitecture description languageArtelys KnitroBackjumpingBarrier functionBiogeography-based optimizationBisection (software engineering)Boundary estimation in EITBranch and boundBranch and cutCandidate (disambiguation)Candidate solutionCandidate solutionsCapital market lineCavalieri's quadrature formulaCombinatorial optimizationComputational complexity theoryConstraint (mathematics)Constraint learningConstraint satisfactionConvex optimizationCore (game theory)Crossover (genetic algorithm)Cutting-plane methodDifferential evolutionDirect methods (electron microscopy)Dispersive flies optimisationDocking (molecular)Duality (optimization)Edgeworth conjectureEfficient frontierEquation solvingEvolutionary algorithmEvolutionary computationFeasibilityFeasible regionFeasible setFeasible set (optimization)
Link from a Wikipage to another Wikipage
primaryTopic
Feasible region
In mathematical optimization, a feasible region, feasible set, search space, 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 Minimize with respect to the variables and subject to and Constraint satisfaction is the process of finding a point in the feasible region.
has abstract
In mathematical optimization, ...... point in the feasible region.
@en
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,017,134,108
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
type
comment
In mathematical optimization, ...... point in the feasible region.
@en
label
Feasible region
@en