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