{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261015-advance-20261115-r04-linear-program-duality-0046"},"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-0046","number":25871,"title":{"zh-Hant":"第 25871 題：線性規劃對偶","en":"Question 25871: 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":"dfd5b0049f2e8d8922ed71623caefc105d3ef60837678c8c998bfa28b7601edc","derivation_sha256":"5c27e2e4de5273983f4a4c94713a2b59d6c2ec7fde731024b92ebb929096b16c"}]}