List all the corner points for the collection of constraints of the linear programming problem. x<13 y≤ 11 7x+8y ≥ 56 x10 y≥0

I tried putting the question in geoGebra but I can’t see the full/complete calculator input of that you put in GEOGEBRA. Please make sure the whole calculation is shown of what you put to get the graph because at the moment I can only see half of it. Also what are ALL the corner points for it so I can find optimal value and also the feasible region

In a linear programming problem, the binding constraints for the optimal solution are:   2x1 + 25x2 ≤ 74 14x1 + 48x2 ≤ 108   What value from the 2nd constraint can the slope of the objective function not exceed in order for the current optimal solution point to remain optimal? Round your solution to 2 decimal places.   thats all the data provided^

please helppppp

Scenario: You are in the process of establishing a small business involving the production of vegetables. Available to you are 50 acres of land space to produce carrots and cabbage. You are hoping to make a profit of $5.00 on the carrots and $4.00 on each cabbage. To produce the crop you have to operate under certain constraints. Required: State at least 3 constraints under which you have to operate? Using your constraints determine the maximum profit you can make from your produce.

List the corner points for the following collection of constraints of a linear programming problem. x ≤ 13 4x + 6y224 X20 y20 a. (0,4), (6, 0), (13,0) b. (0, 0), (6, 0), (0, 13) c. (0, 0), (0, 4), (13,0) d. (0,4), (0, 24), (13, 0) e. (0, 0), (6, 0), (13,0) O O

I have already asked this question. The answer given to me was wrong. Please don't provide me privious answer. Thanks

Apply the procedure for tightening constraints to the following constraint for a pure BIP problem: 2x₁ + 4x₂ - 6x3 ≤ 3

How do I so this in steps? Thanks