{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261021-r06-linear-programming-0080"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261021-r06-linear-programming-0080","number":2455,"title":{"zh-Hant":"第 2455 題：有限線性規劃候選","en":"Question 2455: All Tied Optimizers among the Explicit Feasible Candidates"},"family_id":"qf-app21-lp-finite-optimum","batch_id":"batch-20261013-advance-20261021-r06-linear-programming-foundations","mko_ids":["mko-linear-programming"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"d46df97f36f77f4561eead01b6fd0227e11462376c03e8d920cf4cd038097dde","derivation_sha256":"279c93dec5091c27d6c626d6c416b3f23d059881850c441f47f21f007eb34632"}]}