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