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