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