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