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