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