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