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