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