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