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