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