answersLogoWhite

0

A feasible region is, in a constrained optimization problem, the set of solutions satisfying all equalities and/or inequalities. On the other hand a linear programming is a constrained optimization problem in which both the objective function and the constraints are linear, therefore a feasible region on a linear programming problem is the set of solutions of the a linear problem. Many algorithms had been designed to successfully attain feasibility at the same time as resolving the problem, e.g. reaching its minimum. Perhaps one of the most famous and extensively utilized is the Simplex Method who travels from one extremal point to another, which happens to be the possible extrema given the convex nature of the problem, by maintaining a fixed number of components to zero, called basic variables. Then, the algorithm arrives to a global minimum generally in polinomial time even if its worst possible case has already been proved to be exponencial, see Klee-Minty's cube.

User Avatar

Wiki User

16y ago

Still curious? Ask our experts.

Chat with our AI personalities

LaoLao
The path is yours to walk; I am only here to hold up a mirror.
Chat with Lao
JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi

Add your answer:

Earn +20 pts
Q: How do you get a feasibility region linear programming?
Write your answer...
Submit
Still have questions?
magnify glass
imp