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