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