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