<Dd> Maximize c x subject to Ax ≤ b, x ≥ 0; <Dl> <Dd> with the corresponding symmetric dual problem, </Dd> </Dl> </Dd> <Dl> <Dd> with the corresponding symmetric dual problem, </Dd> </Dl> <Dd> with the corresponding symmetric dual problem, </Dd> <Dd> Minimize b y subject to A y ≥ c, y ≥ 0 . </Dd>

State the standard maximum form of a linear programming problem