{"component":{"type":17,"accent_color":3123338,"components":[{"type":10,"content":"-# WikiRNG · Roll of 10/1/2026 · by [ScarletCrucible](https://wikirng.com/u/ScarletCrucible)"},{"type":10,"content":"## [Fritz John conditions](https://wikirng.com/roll/waW8ZX38KY)"},{"type":10,"content":">>> The Fritz John conditions (abbr. FJ conditions), in mathematics, are a necessary condition for a solution in nonlinear programming to be optimal. They are used as lemma in the proof of the Karush–Kuhn–Tucker conditions, but they are relevant on their own."},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"### 🟩 Notable · 26,594 SP\n-# Top 27%"},{"type":14,"divider":true,"spacing":1},{"type":10,"content":"🟦 🧮 **Equation** · Obscure · +17,295 SP\n-# Has a math formula.\n🟩 ➰ **Stuck in a Loop** · Notable · +5,509 SP\n-# First links loop forever and never reach Philosophy.\n🟩 🔍 **Citation Needed** · Notable · +1,237 SP\n-# Has a \\[citation needed\\] tag.\n🟩 🕊️ **Pigeonholed** · Notable · +1,110 SP\n-# In exactly one category.\n⬜ 🧷 **Lone Source** · Basic · +906 SP\n-# Exactly one footnote.\n⬜ 🪴 **Start-Class** · Basic · +302 SP\n-# Rated Start.\n-# +1 more badge"},{"type":14,"divider":true,"spacing":1},{"type":1,"components":[{"type":2,"style":5,"label":"View roll","url":"https://wikirng.com/roll/waW8ZX38KY"},{"type":2,"style":5,"label":"Read on Wikipedia","url":"https://en.wikipedia.org/wiki/Fritz_John_conditions"}]},{"type":10,"content":"-# Article text from Wikipedia, CC BY-SA 4.0"}]}}