answersLogoWhite

0

Each linear equation is a line that divides the coordinate plane into three regions: one "above" the line, one "below" and the line itself. For a linear inequality, the corresponding equality divides the plane into two, with the line itself belonging to one or the other region depending on the nature of the inequality.

A system of linear inequalities may define a polygonal region (a simplex) that satisfies ALL the inequalities. This area, if it exists, is called the feasible region and comprises all possible solutions of the linear inequalities.

In linear programming, there will be an objective function which will restrict the feasible region to a vertex or an edge of simplex. There may also be a further constraint - integer programming - where the solution must comprise integers. In this case, the feasible region will comprise all the integer grid-ponits with the simplex.

User Avatar

Wiki User

12y ago

Still curious? Ask our experts.

Chat with our AI personalities

FranFran
I've made my fair share of mistakes, and if I can help you avoid a few, I'd sure like to try.
Chat with Fran
CoachCoach
Success isn't just about winning—it's about vision, patience, and playing the long game.
Chat with Coach
DevinDevin
I've poured enough drinks to know that people don't always want advice—they just want to talk.
Chat with Devin

Add your answer:

Earn +20 pts
Q: What is the definition of the solution of linear inequalities?
Write your answer...
Submit
Still have questions?
magnify glass
imp