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