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