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