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