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