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