Fix only primal maximize c^T*x with A*x≤b,x≥0 and dual minimize b^T*y with A^T*y≥c,y≥0. Exact A=[[1, 0], [0, 1]], b=[16, 17], c=[3, 5]. Give (constraint_count, variable_count, A, b, c, transpose_A, primal_convention, dual_convention, dimensions_qualified, certificate).
G001 — Fix only primal maximize c^T*x with A*x≤b,x≥0 and dual minimize b^T*y with A^T*y≥c,y≥0. Exact A=[[1, 0], [0, 1]], b=[16, 17], c=[3, 5]. Give (constraint_count, variable_count, A, b, c, transpose_A, primal_convention, dual_convention, dimensions_qualified, certificate).
Definition and scope
Use the original question domain, assumptions and cited MKO definitions. This item has second-context mathematical and bilingual review, with the model, answer and every arithmetic step independently recomputed from the original parameters; the source question remains a candidate.
List the full source field order without JavaScript.LP weak uses13 fields,zero/strong15;premises and roles follow the original operation/mode without padding.
The fixed max/<=/x>=0 convention pairs with min/>=/y>=0.The dual has m variables and n constraints.Transpose every position;either coefficient sign is legal and dimensions do not imply feasibility.
The full substitutions and premise checks give the original answer; source identity,format and status are unchanged.
This question review and source binding
Review date: 2026-10-26
Original questions, answers, step expressions, numeric ASTs and historical records are retained. Source candidate labels remain historical and are not overwritten as formal proof.