{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"q":"q-20261013-advance-20261025-r03-convex-optimization-problem-0039"},"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-0039","number":11914,"title":{"zh-Hant":"第 11914 題：凸最佳化問題","en":"Question 11914: 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":"fa2e3e4485334b4bf853d801c15f9c71910659c23a78516b5e1c8425a3ed37b0","derivation_sha256":"d8ec842b584518934627286e9a4cdcbd6d9df1acc34d8e34d8624b41fc9f6c64"}]}