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