Simple linear programming problem

1. For the parameters of the objective function $c$, Because the standard type is $min$, So when finding the maximum value, you need to add a minus sign to the function to find the minimum value , Write in function parameters $-c$ that will do
2. For the parameter of inequality $A,b$ , The standard type is $\le$, So if the condition constraint is $\ge$, First transform all inequalities into $\le$ Rewrite matrix $A,b$

c = [4000 3000];
A = [2 1; 1 1; 1 0];
b = [10 8 7];
lb = [0 0];
[x, fval] = linprog(-c, A, b, [], [], lb)

3. Because there is no equation in the conditional constraint , therefore $aeq,beq$ use $[],[]$ Replace it
4. next $lb$ Can pass $zeros$ Function quick creation ,$zeros(1,3$ Create and return one $1\times 3$ Matrix