<Dl> <Dd> <Table> <Tr> <Td_colspan="2"> Minimize: L ⋅ y L + F ⋅ y F + P ⋅ y P (\ displaystyle L \ cdot y_ (L) + F \ cdot y_ (F) + P \ cdot y_ (P)) </Td> <Td> (minimize the total cost of the means of production as the "objective function") </Td> </Tr> <Tr> <Td> subject to: </Td> <Td> y L + F 1 ⋅ y F + P 1 ⋅ y P ≥ S 1 (\ displaystyle y_ (L) + F_ (1) \ cdot y_ (F) + P_ (1) \ cdot y_ (P) \ geq S_ (1)) </Td> <Td> (the farmer must receive no less than S for his wheat) </Td> </Tr> <Tr> <Td> </Td> <Td> y L + F 2 ⋅ y F + P 2 ⋅ y P ≥ S 2 (\ displaystyle y_ (L) + F_ (2) \ cdot y_ (F) + P_ (2) \ cdot y_ (P) \ geq S_ (2)) </Td> <Td> (the farmer must receive no less than S for his barley) </Td> </Tr> <Tr> <Td> </Td> <Td> y L, y F, y P ≥ 0 (\ displaystyle y_ (L), y_ (F), y_ (P) \ geq 0) </Td> <Td> (prices cannot be negative). </Td> </Tr> </Table> </Dd> </Dl> <Dd> <Table> <Tr> <Td_colspan="2"> Minimize: L ⋅ y L + F ⋅ y F + P ⋅ y P (\ displaystyle L \ cdot y_ (L) + F \ cdot y_ (F) + P \ cdot y_ (P)) </Td> <Td> (minimize the total cost of the means of production as the "objective function") </Td> </Tr> <Tr> <Td> subject to: </Td> <Td> y L + F 1 ⋅ y F + P 1 ⋅ y P ≥ S 1 (\ displaystyle y_ (L) + F_ (1) \ cdot y_ (F) + P_ (1) \ cdot y_ (P) \ geq S_ (1)) </Td> <Td> (the farmer must receive no less than S for his wheat) </Td> </Tr> <Tr> <Td> </Td> <Td> y L + F 2 ⋅ y F + P 2 ⋅ y P ≥ S 2 (\ displaystyle y_ (L) + F_ (2) \ cdot y_ (F) + P_ (2) \ cdot y_ (P) \ geq S_ (2)) </Td> <Td> (the farmer must receive no less than S for his barley) </Td> </Tr> <Tr> <Td> </Td> <Td> y L, y F, y P ≥ 0 (\ displaystyle y_ (L), y_ (F), y_ (P) \ geq 0) </Td> <Td> (prices cannot be negative). </Td> </Tr> </Table> </Dd> <Table> <Tr> <Td_colspan="2"> Minimize: L ⋅ y L + F ⋅ y F + P ⋅ y P (\ displaystyle L \ cdot y_ (L) + F \ cdot y_ (F) + P \ cdot y_ (P)) </Td> <Td> (minimize the total cost of the means of production as the "objective function") </Td> </Tr> <Tr> <Td> subject to: </Td> <Td> y L + F 1 ⋅ y F + P 1 ⋅ y P ≥ S 1 (\ displaystyle y_ (L) + F_ (1) \ cdot y_ (F) + P_ (1) \ cdot y_ (P) \ geq S_ (1)) </Td> <Td> (the farmer must receive no less than S for his wheat) </Td> </Tr> <Tr> <Td> </Td> <Td> y L + F 2 ⋅ y F + P 2 ⋅ y P ≥ S 2 (\ displaystyle y_ (L) + F_ (2) \ cdot y_ (F) + P_ (2) \ cdot y_ (P) \ geq S_ (2)) </Td> <Td> (the farmer must receive no less than S for his barley) </Td> </Tr> <Tr> <Td> </Td> <Td> y L, y F, y P ≥ 0 (\ displaystyle y_ (L), y_ (F), y_ (P) \ geq 0) </Td> <Td> (prices cannot be negative). </Td> </Tr> </Table> <Tr> <Td_colspan="2"> Minimize: L ⋅ y L + F ⋅ y F + P ⋅ y P (\ displaystyle L \ cdot y_ (L) + F \ cdot y_ (F) + P \ cdot y_ (P)) </Td> <Td> (minimize the total cost of the means of production as the "objective function") </Td> </Tr>

Define feasible solution to the general linear programming problem