Corner Points: Difference between revisions
Jump to navigation
Jump to search
(Created page with "{{Learning concept |Description=If any LP problem has an optimal solution with a finite objective function value, this solution will always occur at a point in the feasible re...") |
No edit summary |
||
Line 1: | Line 1: | ||
{{Learning concept | {{Learning concept | ||
|Description=If any LP problem has an optimal solution with a finite objective function value, this solution will always occur at a point in the feasible region where two or more of the boundary lines of the constraints intersect. | |Description=If any LP problem has an optimal solution with a finite objective function value, this solution will always occur at a point in the feasible region where two or more of the boundary lines of the constraints intersect. These points of intersection are sometimes called corner points or extreme points of the feasible region. | ||
}} | }} |
Latest revision as of 13:12, 30 December 2013
Description
If any LP problem has an optimal solution with a finite objective function value, this solution will always occur at a point in the feasible region where two or more of the boundary lines of the constraints intersect. These points of intersection are sometimes called corner points or extreme points of the feasible region.
Concept Prerequisite
Wikipedia Reference
Learning Material
Covered in Topic(s)
Overview of Optimization |