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