# OCME ยท Knowledge & practice explorer 302 MKO / 1,441 families / 360 batches / 36,000 questions. 36,000 second-context math/bilingual reviewed; 0 display/symbol-checked candidates. Source questions: candidate. English: ai_candidate. No new proof, Lean, SREG or training. 100 results; page 2/4. ## Question 11926: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0051`; number: 11926 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0051/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0051/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0051.json) ## Question 11927: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0052`; number: 11927 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0052/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0052/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0052.json) ## Question 11928: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0053`; number: 11928 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0053/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0053/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0053.json) ## Question 11929: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0054`; number: 11929 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0054/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0054/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0054.json) ## Question 11930: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0055`; number: 11930 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0055/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0055/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0055.json) ## Question 11931: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0056`; number: 11931 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0056/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0056/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0056.json) ## Question 11932: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0057`; number: 11932 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0057/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0057/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0057.json) ## Question 11933: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0058`; number: 11933 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0058/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0058/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0058.json) ## Question 11934: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0059`; number: 11934 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0059/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0059/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0059.json) ## Question 11935: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0060`; number: 11935 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0060/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0060/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0060.json) ## Question 11936: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0061`; number: 11936 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0061/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0061/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0061.json) ## Question 11937: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0062`; number: 11937 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0062/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0062/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0062.json) ## Question 11938: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0063`; number: 11938 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0063/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0063/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0063.json) ## Question 11939: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0064`; number: 11939 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0064/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0064/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0064.json) ## Question 11940: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0065`; number: 11940 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0065/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0065/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0065.json) ## Question 11941: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0066`; number: 11941 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0066/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0066/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0066.json) ## Question 11942: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0067`; number: 11942 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0067/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0067/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0067.json) ## Question 11943: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0068`; number: 11943 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0068/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0068/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0068.json) ## Question 11944: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0069`; number: 11944 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0069/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0069/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0069.json) ## Question 11945: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0070`; number: 11945 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0070/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0070/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0070.json) ## Question 11946: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0071`; number: 11946 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0071/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0071/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0071.json) ## Question 11947: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0072`; number: 11947 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0072/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0072/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0072.json) ## Question 11948: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0073`; number: 11948 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0073/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0073/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0073.json) ## Question 11949: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0074`; number: 11949 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0074/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0074/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0074.json) ## Question 11950: Evaluate the Polynomial while Separately Reporting Feasibility - ID: `q-20261013-advance-20261025-r03-convex-optimization-problem-0075`; number: 11950 - Processing: second_context_reviewed - MKO: [mko-convex-optimization-problem](/en/mko/mko-convex-optimization-problem/) - Family: [qf-mod25-convexopt-objective-at-feasible-point](/en/explore/?family=qf-mod25-convexopt-objective-at-feasible-point) - Batch: [batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations](/en/explore/?batch=batch-20261013-advance-20261025-r03-convex-optimization-problem-foundations) - [Derivation](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0075/) / [Markdown](/en/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0075/index.md) / [JSON](/data/question-derivations/questions/q-20261013-advance-20261025-r03-convex-optimization-problem-0075.json) [Next](/en/explore/index.md?mko=mko-convex-optimization-problem&page=3)