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