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