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