I want definition of banding and feasible range in operation

I want definition of banding and feasible range in operation research

Solution

I think you might be referring to

1. Binding --> Binding is a form of constraints , for example the constraints that are equality one like A(y) = m are always binding . Let h(x) a be a constraint in an optimization problem (minimizing or mazimizing the objective function subject to some contsraints ). The constraints is said to be binding if at point k Rⁿ we have h(k) = a.

2. Feasible Range of Linear Programming Problem---> The range which gives us the solution space or we can say the range where all the constraints like equalities, inequalities etc are satisfied and we get the feasible region in that range.

I hope it clarifies, Let me know if there is something.

Thanks