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