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