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