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