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