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