{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0029"},"total":1,"page":1,"page_count":1,"question_state":"candidate","english_state":"ai_candidate","canonical_truth_promotion":false,"entries":[{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0029","number":11904,"title":{"zh-Hant":"第 11904 題：凸最佳化問題","en":"Question 11904: Feasibility Alone Supplies No Optimum"},"family_id":"qf-mod25-convexopt-feasible-point-audit","batch_id":"batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations","mko_ids":["mko-convex-optimization-problem"],"question_state":"candidate","english_state":"ai_candidate","processing_state":"second_context_reviewed","source_question_sha256":"4544289de801af2061859d4ebee26624c8b01be3e4d8dec09696510fd994471c","derivation_sha256":"1e92eaadfa9cf99c01ff4e8e8452a62861ce95dc00709e64ee818acd924b7522"}]}