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