{"schema_version":"ocme-public-explorer-results-v1","locale":"zh-Hant","filters":{"family":"qf-mod25-convexopt-objective-at-feasible-point"},"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-0051","number":11926,"title":{"zh-Hant":"第 11926 題：凸最佳化問題","en":"Question 11926: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"c91cc144f4094c7e971d7a7186d68e3ec2468af714648f6a803553f6dcdb2c9e","derivation_sha256":"d004ae86bad4f3be887bb352e592a2523eb8d63b4efe1fb747131ac387fb3e38"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0052","number":11927,"title":{"zh-Hant":"第 11927 題：凸最佳化問題","en":"Question 11927: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"24c70c22451af8e05ebf215b2c47a3247ea33e48ab3d8c38b0a43fac7319de39","derivation_sha256":"d273b072382e01e985dd77abd7328dbfd3772ed209ef298d04ef4adcdf7127b6"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0053","number":11928,"title":{"zh-Hant":"第 11928 題：凸最佳化問題","en":"Question 11928: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"133517413d624f4ee04dd6467bc14afbd451080c8be811e2aecfa0676de19aad","derivation_sha256":"175963aac2e8e4299e4e30de289efe1e01e3e81e255156ae6fe373cadc8118ff"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0054","number":11929,"title":{"zh-Hant":"第 11929 題：凸最佳化問題","en":"Question 11929: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"bf81427e708819793d73c9358abdf4fedec1f5aea6daacd97182be011aaff19f","derivation_sha256":"d9128b249f8dc1832a8741f1554b7cb1f430449c89cefb4bf28c0f945d56adff"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0055","number":11930,"title":{"zh-Hant":"第 11930 題：凸最佳化問題","en":"Question 11930: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"63ad10ecb9a09dba6870fff096d4e9f5d7ceaebbfa0188625afdd76bddd4da72","derivation_sha256":"1b5e7e767037e30d7b5c90e379bd203d58df56f7d2c8e32767471ef589441706"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0056","number":11931,"title":{"zh-Hant":"第 11931 題：凸最佳化問題","en":"Question 11931: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"3d73778f818cc9ccac516a821556a9fc815fd905cb37389e4f5a87434530f27e","derivation_sha256":"dc1e7a8083f86001f6b36712bc6e79a535b41d432c44e8de5b94d885afb891eb"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0057","number":11932,"title":{"zh-Hant":"第 11932 題：凸最佳化問題","en":"Question 11932: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"872664b6fba33128e3141d64a343467ac7878b62bb6d80eb86fbd0df10c081d0","derivation_sha256":"5a9e9b9419f825c6ab774a6c16bf241b129da8c59ab9bd4cb33223f150ef4fd7"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0058","number":11933,"title":{"zh-Hant":"第 11933 題：凸最佳化問題","en":"Question 11933: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"febbdad23295b209dd08a72b372de6cdcf66691844c281166cb28733299f485b","derivation_sha256":"5a79afd64a9c4213ab713d09b8bf46d74dee12697569015199b05557c330c341"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0059","number":11934,"title":{"zh-Hant":"第 11934 題：凸最佳化問題","en":"Question 11934: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"6310630b06fb289d3d34f8e201eecbb5a0bb687c888f8db8e5326e8e86e2571f","derivation_sha256":"12256ef2b44334c9da5d6a591009fd813d4b5023bbec9672d6687fe88b113ec1"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0060","number":11935,"title":{"zh-Hant":"第 11935 題：凸最佳化問題","en":"Question 11935: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"965033d88690601927097501459f5123ce05bb345c6b696ed1e52ceb35848982","derivation_sha256":"8fdf861dea9c9c48e075b3284a3d99641e97542d4cebc25bc6f2ba4a8d2cc396"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0061","number":11936,"title":{"zh-Hant":"第 11936 題：凸最佳化問題","en":"Question 11936: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"ccdd70d1e37849222db1de3ffc0a45cdacb41b7fabb4702df921ddfdc040736c","derivation_sha256":"beaeda450e7d616f1628ea45e9669b5596035a335e2549e67469aa6453137e15"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0062","number":11937,"title":{"zh-Hant":"第 11937 題：凸最佳化問題","en":"Question 11937: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"649a6b44a55830642422292a2ff1d398c545795787da4b138f4dc105fe523e45","derivation_sha256":"ca31386c1e9754d6569d3fe2329fd39d7adf68b641b3678dd484db705fb7e9a6"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0063","number":11938,"title":{"zh-Hant":"第 11938 題：凸最佳化問題","en":"Question 11938: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"af05d52ba9b02919d2fae2b1fcfbd9a864b3a234221175faf70033260d3d19e0","derivation_sha256":"43a59f89533490c1dd030c68e613c60780e44f3077675c2d1afa2c7ee3fc383c"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0064","number":11939,"title":{"zh-Hant":"第 11939 題：凸最佳化問題","en":"Question 11939: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"6b2ab6a43e00b54ecf0e030a2fa8583c921b26fe412cc1d3dda67d48b3bc6a94","derivation_sha256":"1abb377e5622787252fff8df07a0db95e178185724ef6d064f8ddf1726a78eab"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0065","number":11940,"title":{"zh-Hant":"第 11940 題：凸最佳化問題","en":"Question 11940: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"4a464a970352878b1aab89018bdfe51590aa78ade5607a4637f327a63d353575","derivation_sha256":"5d2f340cf59fa023b3730fb2bcbea4b0f6d3d299ae33bd10baa546339aa83ab9"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0066","number":11941,"title":{"zh-Hant":"第 11941 題：凸最佳化問題","en":"Question 11941: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"222c9d9efe995c780435974563d8664a57c07990562c06fb980896f5f875ef48","derivation_sha256":"041e84e5466acf9013844805f6896e571c21a8917c0377179a4559861c7b4d25"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0067","number":11942,"title":{"zh-Hant":"第 11942 題：凸最佳化問題","en":"Question 11942: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"8cf94d17b3db0544f5ac79c45bba70ac8d9402f1a3b3098c940912e94808328e","derivation_sha256":"804a4c902765d7c8f6d74450379b32ccac1e3301803c0880274917deeee27504"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0068","number":11943,"title":{"zh-Hant":"第 11943 題：凸最佳化問題","en":"Question 11943: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"87feeb2205803e03617023f7c98fdb294446ba245de0f99a6ed2f5cd9b0f6f7f","derivation_sha256":"d5bc17dcc3b9d06c59486a5aa6ccc8b5065f9e0db230122596bd31248fc54d12"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0069","number":11944,"title":{"zh-Hant":"第 11944 題：凸最佳化問題","en":"Question 11944: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"e3c5b4ebba89840d4076f99d16151ac24f1417bbb4ffee6f6e2b559c5f206ce8","derivation_sha256":"4dca06706d2064d9243640461dc8861203da2ac61a2202aa0ed31b6c162b712c"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0070","number":11945,"title":{"zh-Hant":"第 11945 題：凸最佳化問題","en":"Question 11945: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"ec012e99a80d306ed3f81dc4b15258f4958ab87ca3e295e8fcca8eeebf8e44e5","derivation_sha256":"1eb7f0adc0c35862df31056a08edcf02d44ba78bdc5fa243371f8b1707efda83"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0071","number":11946,"title":{"zh-Hant":"第 11946 題：凸最佳化問題","en":"Question 11946: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"fcaf6ebd9a75a800778938f11d90260787d4b332da0f174db9bc4e7274a6a7ef","derivation_sha256":"95ac3b09e27db9e91d2e8935c304ea67b5bedc778012cfb6ef503293dca496c0"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0072","number":11947,"title":{"zh-Hant":"第 11947 題：凸最佳化問題","en":"Question 11947: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"becc611d154b77389ed6b53ec999b2b794eec1472b8a9758994e0f7b15d30533","derivation_sha256":"b1907c790e0d658a2f0dc570462feca14cba937e855129e3ad5940a86638d613"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0073","number":11948,"title":{"zh-Hant":"第 11948 題：凸最佳化問題","en":"Question 11948: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"8ed61f67a97fc7f5f41352a173a0976f6331aa08785935825a3068dfab332c4f","derivation_sha256":"f5349f434aaa62b4179e05b191a123ec5a18800e0dc6a5e0a265d1c440ffb0d9"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0074","number":11949,"title":{"zh-Hant":"第 11949 題：凸最佳化問題","en":"Question 11949: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"54c5f28746952c1487f6cce71d53295ccd10415d6f75da43af087d8cc7a17f7a","derivation_sha256":"16421d5809cc295c032254ad36f03898531ab8a24b1725e5dc7885f25bf68163"},{"question_id":"q-20261013-advance-20261025-r03-convex-optimization-problem-0075","number":11950,"title":{"zh-Hant":"第 11950 題：凸最佳化問題","en":"Question 11950: Evaluate the Polynomial while Separately Reporting Feasibility"},"family_id":"qf-mod25-convexopt-objective-at-feasible-point","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":"d48b2c691864f9fd2bc45c99f5944aeb89707eb4a04aa3639fb6b42fdf65a90a","derivation_sha256":"54800c41b8261e20c91fa4e79ffb5b49aee3a1537e78e33b68fe848b96f9a65f"}]}