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