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