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