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