{"schema_version":"ocme-public-explorer-results-v1","locale":"en","filters":{"family":"qf-mod25-convexopt-feasible-point-audit"},"total":25,"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-0026","number":11901,"title":{"zh-Hant":"第 11901 題：凸最佳化問題","en":"Question 11901: 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":"14f2f37b78355ee830aaf05f65309f3d725cef2bff2e099bfc67bffcf34d6803","derivation_sha256":"57855610217738b90ff11dfdd12495591272a7c4895126b9fe1a687b8e0bc8ce"},{"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"},{"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"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0029","number":11904,"title":{"zh-Hant":"第 11904 題：凸最佳化問題","en":"Question 11904: 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":"4544289de801af2061859d4ebee26624c8b01be3e4d8dec09696510fd994471c","derivation_sha256":"1e92eaadfa9cf99c01ff4e8e8452a62861ce95dc00709e64ee818acd924b7522"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0030","number":11905,"title":{"zh-Hant":"第 11905 題：凸最佳化問題","en":"Question 11905: 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":"20cd5cbcc2f47236d0063522a2aeee78b8c32dd1341f8b9d92537a5d1869b553","derivation_sha256":"a26554ffea7c1e234fe599612800667e6830bfd0af586a0cff8e7c5455979067"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0031","number":11906,"title":{"zh-Hant":"第 11906 題：凸最佳化問題","en":"Question 11906: 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":"65be5fa7217a19f4394a5d5a2b3a5a125cbb927fd20f36072f16574e4589eef3","derivation_sha256":"95a6b67f74a0b2340d09159f06d0acd15c01c7b60dfda4bde4c0dbd3516cddca"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0032","number":11907,"title":{"zh-Hant":"第 11907 題：凸最佳化問題","en":"Question 11907: 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":"3bc079fdf3cb8633756f2984ccbe444de1ff9ccf3566fcfd45912bef6045f6e4","derivation_sha256":"8f8871a9620a905c17a8466a140cb85f1cd69a045ffbcce4dde22ba37dd32330"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0033","number":11908,"title":{"zh-Hant":"第 11908 題：凸最佳化問題","en":"Question 11908: 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":"12c5bfb621b8cc4997f1c99ddf6cd9efbc61aa04e70eb7d3acaeb79f535ef418","derivation_sha256":"2de84501fba6a29371a959b9f63ec35eaa10db09297402fa95e84354e007699a"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0034","number":11909,"title":{"zh-Hant":"第 11909 題：凸最佳化問題","en":"Question 11909: 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":"ce07aeda6badce1fac54f5fe4fd0acbb41ba1ef6158b0a390b0c817a3850e423","derivation_sha256":"d6ec6a3b2a5ecbb97c866d693adc1a0d35519f0715d51797a60b866ec007f1d3"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0035","number":11910,"title":{"zh-Hant":"第 11910 題：凸最佳化問題","en":"Question 11910: 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":"2c7a37276f5ae13503cff745cf1b2bb8c56c0d16be6f4fa6f566b2ebedd9746c","derivation_sha256":"599eaa5f4e1b510a2906602042277d355bbab73d230457c8e01e3f72b54329f4"},{"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"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0037","number":11912,"title":{"zh-Hant":"第 11912 題：凸最佳化問題","en":"Question 11912: 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":"43587a64b7682d36d9dfa805043425fc7dd1a58bfc88ece45e307da5f95d05ea","derivation_sha256":"bffb989d53827fa8fe9513873b58392d7b3e74018240ca52b8226aad844e5a7d"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0038","number":11913,"title":{"zh-Hant":"第 11913 題：凸最佳化問題","en":"Question 11913: 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":"af89ce133bdf56bebfe39e8fc12480f304f2a76ab5c07193eaec792c8fb8d24a","derivation_sha256":"9593005f70451aacd5ebbf9fa54288fff738fb8e19ad219402c4497eff0add17"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0039","number":11914,"title":{"zh-Hant":"第 11914 題：凸最佳化問題","en":"Question 11914: 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":"fa2e3e4485334b4bf853d801c15f9c71910659c23a78516b5e1c8425a3ed37b0","derivation_sha256":"d8ec842b584518934627286e9a4cdcbd6d9df1acc34d8e34d8624b41fc9f6c64"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0040","number":11915,"title":{"zh-Hant":"第 11915 題：凸最佳化問題","en":"Question 11915: 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":"db23add2755ac849456fe1da29adb050eb9694498b3ac6fce71c250cd22c1235","derivation_sha256":"098ebb4bf4d245a2b6a51cfbe395963ca3748c61ed5c9da1fa3c33a4f79ca82e"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0041","number":11916,"title":{"zh-Hant":"第 11916 題：凸最佳化問題","en":"Question 11916: 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":"107a0e43718847f4c219af407017eca88a146b59aa6e7f0218c7603f0b0b9339","derivation_sha256":"cbee726cd246bc670f29e8d6e47a66160de6622bf243b3ed359b4936be14bad0"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0042","number":11917,"title":{"zh-Hant":"第 11917 題：凸最佳化問題","en":"Question 11917: 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":"144f7eb3a8983f891a10348b9b9d72d7dba767c198b67610bd2b882ea230f9cb","derivation_sha256":"49a41b239ffc5cc08d4c7da3af1e0cab52fbe1d721f77c8c77ca4dc281f3b3d6"},{"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"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0044","number":11919,"title":{"zh-Hant":"第 11919 題：凸最佳化問題","en":"Question 11919: 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":"f39938b219f52da964d58584fc16898e25233da9e47e405dbd5b2ce63a90f9f1","derivation_sha256":"8bd2ab029e811301698a189e465574b3cd1942ca0eccb031bc0ca4be77f5fede"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0045","number":11920,"title":{"zh-Hant":"第 11920 題：凸最佳化問題","en":"Question 11920: 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":"b3a5adb25e038db09e229c1866cbefcb7966686b4602c856c50c71d641a3fca8","derivation_sha256":"093869a01e7022a933893ba87123cfd0b0b949ac63b337cab186a3cfa5817c22"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0046","number":11921,"title":{"zh-Hant":"第 11921 題：凸最佳化問題","en":"Question 11921: 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":"ca86dd0cd7a348ae1471bde0acd8240c871dd2bbbbcf05a3fd18455879ba0408","derivation_sha256":"f767adb2bed79052be0c0584e8ce17b266a1c16876a15a049f35203ed460e78e"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0047","number":11922,"title":{"zh-Hant":"第 11922 題：凸最佳化問題","en":"Question 11922: 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":"1f1bbedcc06d2d48c574b69e654f62fa437d8753fb80535e425b1d274e8735d8","derivation_sha256":"eff1ceea14ebddd08c79f03ccf971bae14186fca634a9fc4abb7862c99c4d57e"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0048","number":11923,"title":{"zh-Hant":"第 11923 題：凸最佳化問題","en":"Question 11923: 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":"51e8cdbf345be39e3c6f35c09fadab3261779c721c5e53621e651741a1897a6e","derivation_sha256":"a80f1488f446c8877a25ab7a118aae24a56120a6debd9ac9705e3b94492c1c6f"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0049","number":11924,"title":{"zh-Hant":"第 11924 題：凸最佳化問題","en":"Question 11924: 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":"b070376475add98319e9cff0f56312daaf641303b273972895bee801c74c79a5","derivation_sha256":"d1fbe9522d4d3a63557d7a4fbdc20051f99cadb1fae055745d6c878f66f971e0"},{"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"}]}