WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Feasible region
Common card · Science
Feasible region, a Common card
In mathematical optimization and computer science, a feasible region, feasible set, or solution space is the set of all possible points of an optimization problem that satisfy the problem's constraints, potentially including inequalities, equalities, and integer constraints.
- Rarity
- Common
- Domain
- Science
- ATK
- 54
- DEF
- 29
- Power
- 83
- Wikipedia reads a year
- 8,500
Power 83 (ATK + DEF): stronger than 25 % of WikiCards cards.
Feasible region quiz: 3 questions
Three questions on the Feasible region card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
This is the initial set of candidate solutions to the problem, before the set of ______ has been narrowed down.
Answer
candidates. This is the initial set of candidate solutions to the problem, before the set of candidates has been narrowed down. From the Feasible region article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
Join and meet. Join and meet 59 · Feasible region 54 · Brain coral 49 · Voiceless bilabial affricate 46 ATK in WikiCards.
Which of these Wikipedia articles is read the most in a year?
Answer
Brain coral. Brain coral 20,000 · Join and meet 15,000 · Stereographic map projection 12,000 · Feasible region 8,500 Wikipedia reads over a year.
In a duel, each round asks a question like these about the opposing card, with 15 seconds to answer.
The facts on the card
The card carries these facts from its Wikipedia article.
- 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 + y 4 with respect to the variables x and y, subject to 1 ≤ x ≤ 10 and 5 ≤ y ≤ 12. Here the feasible set is the set of pairs in which the value of x is at least 1 and at most 10 and the value of y is at least 5 and at most 12.
- The feasible set of the problem is separate from the objective function, which states the criterion to be optimized and which in the above example is x 2 + y 4. In many problems, the feasible set reflects a constraint that one or more variables must be non-negative.
Why it is Common
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Feasible region article was read about 8,500 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 54 and blocks with 29: each hit it takes is cut by 12 %.
How to get Feasible region
Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.
More Science cards
Cards close in power
The cards just above and just below Feasible region in the power ranking, all domains together.
- North End tube stationCommon · Society · ATK 52 DEF 31
- Robert YatesCommon · Society · ATK 56 DEF 27
- Topkapı DaggerCommon · History · ATK 48 DEF 35
- James C. MortonCommon · Arts · ATK 61 DEF 22
- AC GreyhoundCommon · Science · ATK 43 DEF 40
- Football in EstoniaCommon · Society · ATK 56 DEF 27
Card lists
- Wikipedia quizNew questions every day
- All cards from A to ZEvery card, by name
- Science cards
- Legendary cards
- Tier listS and A tiers by power (ATK + DEF)
Credits
Text : Wikipedia, Feasible region (revision), CC BY-SA 4.0. Photo : Fanosta, CC BY-SA 4.0, Wikimedia Commons.
