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