{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261021-r06-linear-programming-0096"},"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-0096","number":2471,"title":{"zh-Hant":"第 2471 題：有限線性規劃候選","en":"Question 2471: 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":"1c8908d5bc5437bdb6440bf08644467be4b2e0875ea3582611da03f97e1c5076","derivation_sha256":"611e22bcfb5c7b66122448af83813b2be7d32d22af51f0575d3233c4df3fde44"}]}