Review set
Conversion to Standard Form
Programs arriving in every shape the conversion rules have to handle: a maximisation, a constraint pointing the wrong way, a variable free in sign, a bound that is not zero. Mixed rather than grouped by rule, since deciding which conversion a line needs is the part that is assessed.
What this involves
Retrieval after a delay, which is what makes knowledge durable.
Answers here count towards what the system knows about your skills.
What this covers
- Convert a linear program to standard form
Given a linear program stated with any mix of maximization or minimization, inequality or equality constraints, and sign-restricted or free variables, the learner can produce an equivalent standard-form program with a minimization objective, equality constraints, and all variables nonnegative, without a conversion checklist in view.
- Transform variables to meet the nonnegativity condition
Given a linear program whose variables carry sign restrictions other than simple nonnegativity, the learner can select and apply the appropriate substitution for each, carry it through the objective and every constraint, account for any constant it produces, and state how an original solution is recovered from the converted one.