Mathematical optimization, an Uncommon card

The card carries these facts from its Wikipedia article.

• It is generally divided into two subfields: discrete optimization and continuous optimization.
• Optimization problems arise in all quantitative disciplines from computer science and engineering to operations research and economics, and the development of solution methods has been of interest in mathematics for centuries.
• In the more general approach, an optimization problem consists of maximizing or minimizing a real function by systematically choosing input values from within an allowed set and computing the value of the function.

Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Mathematical optimization article was read about 110,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 77 and blocks with 57: each hit it takes is cut by 23 %.

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.

The cards just above and just below Mathematical optimization in the power ranking, all domains together.