Standard form of linear programming

Standard form rules

• The objective function is minimized (min)
• The constraint must be an equation, and the right side of the equation cannot be a negative number.
• The values ​​of all variables must be non-negative

example

topic

Please write down the standard form of the following linear programming:

arbitrary

answer

For the first line, we just need to replace it with :

For the second line, we just add a variable to the left :

For the third line, we need to first change the number on the right to non-negative: , and then change the sign to an equal sign:

For all rows, we need to replace any variable with ,

So the final standard form is: