Feasible Region: The set of all points that satisfy all constraints in a system of inequalities
Bounded Region: A region that can be enclosed within a circle of finite radius
Corner Point (Vertex): A point where boundary lines of the feasible region intersect
Constraints: Inequalities that define the feasible region
1. Graph each inequality on the same coordinate plane
2. Identify the intersection of all solution regions
3. Find corner points by solving pairs of boundary equations
4. Determine if region is bounded (enclosed) or unbounded (extends infinitely)
5. Verify corner points satisfy all constraints
These constraints restrict us to the first quadrant (including axes)
Boundary lines: x = 0 (y-axis) and y = 0 (x-axis), both solid lines
Boundary line: x + y = 6
When x = 0: y = 6 → point (0, 6)
When y = 0: x = 6 → point (6, 0)
Shading: Below the line (test point (0,0): 0 + 0 ≤ 6 ✓)
Boundary line: 2x + y = 8
When x = 0: y = 8 → point (0, 8)
When y = 0: x = 4 → point (4, 0)
Shading: Below the line (test point (0,0): 2(0) + 0 ≤ 8 ✓)
Intersection of x = 0 and y = 0: (0, 0)
Intersection of x = 0 and x + y = 6: (0, 6)
Intersection of y = 0 and 2x + y = 8: (4, 0)
Intersection of x + y = 6 and 2x + y = 8:
Subtract first from second: (2x + y) - (x + y) = 8 - 6 → x = 2
Substitute: 2 + y = 6 → y = 4
Point: (2, 4)
(0,0): x=0≥0 ✓, y=0≥0 ✓, x+y=0≤6 ✓, 2x+y=0≤8 ✓
(0,6): x=0≥0 ✓, y=6≥0 ✓, x+y=6≤6 ✓, 2x+y=6≤8 ✓
(4,0): x=4≥0 ✓, y=0≥0 ✓, x+y=4≤6 ✓, 2x+y=8≤8 ✓
(2,4): x=2≥0 ✓, y=4≥0 ✓, x+y=6≤6 ✓, 2x+y=8≤8 ✓
The region is enclosed by four lines and forms a quadrilateral
The region can be enclosed in a circle of finite radius
Therefore, the feasible region is BOUNDED
Region: Bounded quadrilateral
Shape: Convex polygon
The feasible region is a bounded quadrilateral with corner points at (0,0), (0,6), (2,4), and (4,0). The region is bounded and convex.
• Bounded Region: Enclosed area with finite extent
• Corner Points: Intersections of boundary lines
• Convexity: Line segment between any two points stays in region
Unbounded Region: A region that extends infinitely in at least one direction
Ray: Part of a line that extends infinitely in one direction
Half-Plane: One side of a boundary line
1. Graph each inequality
2. Identify the feasible region
3. Find corner points (if any)
4. Determine if region extends infinitely in any direction
5) Classify as bounded or unbounded
These constraints restrict us to the first quadrant (including axes)
Boundary lines: x = 0 (y-axis) and y = 0 (x-axis), both solid lines
Convert to slope-intercept: x - y ≥ 2 → -y ≥ -x + 2 → y ≤ x - 2
Boundary line: y = x - 2
When x = 0: y = -2 → point (0, -2)
When y = 0: x = 2 → point (2, 0)
Shading: Below the line (since y ≤ x - 2)
The line y = x - 2 intersects the x-axis at (2, 0)
For the region to be in the first quadrant, we need x ≥ 2 and y ≥ 0
But also y ≤ x - 2
Only intersection point in feasible region: (2, 0)
This occurs where y = 0 (x-axis) and y = x - 2 intersect
0 = x - 2 → x = 2
Point: (2, 0)
Starting from (2, 0), the region extends:
- Horizontally to the right (x increases)
- With y values from 0 up to x - 2
The region extends infinitely to the right
Test point (3, 0.5): x=3≥0 ✓, y=0.5≥0 ✓, x-y=2.5≥2 ✓
Test point (10, 5): x=10≥0 ✓, y=5≥0 ✓, x-y=5≥2 ✓
As x increases, y can range from 0 to x-2
The region extends infinitely in the positive x direction
Therefore, the feasible region is UNBOUNDED
Region: Unbounded
Extends: Infinitely rightward
The feasible region is unbounded with a single corner point at (2, 0). The region extends infinitely to the right, bounded by y = 0 and y = x - 2.
• Unbounded Region: Extends infinitely in some direction
• Corner Point: May exist even in unbounded regions
• Ray Formation: Region extends like a ray in unbounded direction
Linear Programming: Optimization using systems of linear inequalities
Objective Function: Function to be maximized or minimized
Resource Constraints: Limits on available resources
1. Define decision variables
2. Write resource constraints
3. Include non-negativity constraints
4. Graph the feasible region
5. Find corner points
6. Verify constraints
Let x = number of units of Product A produced
Let y = number of units of Product B produced
Product A: 2 hours per unit
Product B: 1 hour per unit
Total labor: 2x + y ≤ 10
Product A: 1 hour per unit
Product B: 3 hours per unit
Total machine time: x + 3y ≤ 15
Cannot produce negative units: x ≥ 0 and y ≥ 0
2x + y ≤ 10 (labor constraint)
x + 3y ≤ 15 (machine time constraint)
x ≥ 0 (non-negativity)
y ≥ 0 (non-negativity)
Intersection of x = 0 and y = 0: (0, 0)
Intersection of x = 0 and x + 3y = 15: (0, 5)
Intersection of y = 0 and 2x + y = 10: (5, 0)
Intersection of 2x + y = 10 and x + 3y = 15:
From first: y = 10 - 2x
Substitute: x + 3(10 - 2x) = 15
x + 30 - 6x = 15 → -5x = -15 → x = 3
y = 10 - 2(3) = 4
Point: (3, 4)
(0,0): 2(0)+0=0≤10 ✓, 0+3(0)=0≤15 ✓
(0,5): 2(0)+5=5≤10 ✓, 0+3(5)=15≤15 ✓
(5,0): 2(5)+0=10≤10 ✓, 5+3(0)=5≤15 ✓
(3,4): 2(3)+4=10≤10 ✓, 3+3(4)=15≤15 ✓
Corner Points: (0,0), (0,5), (3,4), (5,0)
Region: Bounded quadrilateral
The feasible region is bounded with corner points at (0,0), (0,5), (3,4), and (5,0). The company can produce any combination of products within this region.
• Resource Constraints: Total usage ≤ available resources
• Non-negativity: Decision variables ≥ 0
• Bounded Region: Finite area with corner points
Convex: Line segment between any two points stays in region
Connected: Single piece, no separated parts
Feasible: All constraints satisfied simultaneously
Optimal: Corner points often contain optimal solutions
Feasible Region: The set of all points that satisfy all constraints in a system of inequalities simultaneously. It represents all possible solutions to the constraint system.
Bounded Region: A region that can be completely enclosed within a circle of finite radius. The region has finite area and extent.
Unbounded Region: A region that extends infinitely in at least one direction. The region has infinite area or extent.
Corner Point (Vertex): A point where boundary lines of the feasible region intersect. These points are critical in optimization problems.
- Identify all constraints: List all inequalities in the system
- Graph each constraint: Plot boundary lines and shade appropriate regions
- Find intersection region: Identify area satisfying all constraints
- Locate corner points: Find intersections of boundary lines
- Determine boundedness: Check if region extends infinitely
- Verify solutions: Test points in different regions
Question: How do I know if a feasible region is bounded or unbounded?
Answer: Look for these characteristics:
Bounded Region:
- Can be completely enclosed in a circle of finite radius
- Has finite area
- Does not extend infinitely in any direction
- All corner points are finite
- Usually forms a closed polygon
Unbounded Region:
- Extends infinitely in at least one direction
- Has infinite area
- Cannot be enclosed in a finite circle
- May have some infinite directions but still have corner points
- Often looks like a ray or infinite strip
Visual Test: If you can draw a circle that completely encloses the feasible region, it's bounded. If the region extends off the page in any direction, it's unbounded.
Question: How do I find corner points of a feasible region?
Answer: Corner points occur where boundary lines intersect:
Method: Solve pairs of boundary equations simultaneously
Steps:
- Identify which boundary lines intersect at each corner
- Set the equations equal to each other
- Solve the resulting system of equations
- Verify the point satisfies all constraints in the system
Example: For constraints y ≤ -x + 4 and y ≥ x - 2, find intersection:
-x + 4 = x - 2 → -2x = -6 → x = 3
Substitute: y = 3 - 2 = 1
Corner point: (3, 1)
Always verify that corner points satisfy ALL constraints!
Question: Why are corner points important in optimization problems?
Answer: Corner points are critical in linear programming:
Linear Programming Fundamental Theorem:
- If an optimal solution exists, it occurs at a corner point of the feasible region
- Or, if optimal solutions exist along an edge, the endpoints of that edge are corner points
- This dramatically reduces the number of points to check
Why this works:
- Linear objective functions have constant slopes
- Optimal values occur at the "extreme" points of the feasible region
- Corner points represent the extreme combinations of variables
Instead of checking infinitely many points in the region, you only need to check the finite number of corner points!
Feasible Regions Guide
• Finite area
• Enclosed by constraints
• All corner points finite
• Can be circumscribed
• Infinite extension
• May have corner points
• Extends infinitely
• Cannot be enclosed
• Boundary intersections
• Solve simultaneous equations
• Critical for optimization
• Extreme combinations
• Line segments stay inside
• No indentations
• Always holds for linear
• Predictable shape