{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261015-advance-20261115-r04-linear-program-duality-0040"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261015-advance-20261115-r04-linear-program-duality-0040","number":25865,"title":{"zh-Hant":"第 25865 題：線性規劃對偶","en":"Question 25865: Both Feasibility Checks Precede the Weak-Duality Inequality Chain"},"family_id":"qf-mod46-lpdual-weak-duality-chain","batch_id":"batch-20261015-advance-20261115-r04-linear-program-duality-foundations","mko_ids":["mko-linear-program-duality"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"d963a32c83c4e5770369cf5a0b8e527f30f655f3ed5940416786c045e3f22c2b","derivation_sha256":"4e28f030e7241f89010dddd5397a6f78b55213bbebc72b3f17a4236ed207812b"}]}