Feasible Regions

Master feasible regions in systems of inequalities: bounded/unbounded regions, corner points, constraints, and applications through detailed exercises and comprehensive examples.

Exercise Solutions: Feasible Regions
1 Bounded Feasible Region
Exercise 1
Find the feasible region for the system: x ≥ 0, y ≥ 0, x + y ≤ 6, and 2x + y ≤ 8. Identify all corner points and determine if the region is bounded or unbounded.
Key Definitions:

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

Feasible Region Analysis:

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

Constraints
\(x \geq 0, y \geq 0, x + y \leq 6, 2x + y \leq 8\)
Region
Bounded
Corner Points
(0,0), (0,6), (2,4), (4,0)
Step 1: Graph x ≥ 0 and y ≥ 0

These constraints restrict us to the first quadrant (including axes)

Boundary lines: x = 0 (y-axis) and y = 0 (x-axis), both solid lines

Step 2: Graph x + y ≤ 6

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 ✓)

Step 3: Graph 2x + y ≤ 8

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 ✓)

Step 4: Find corner points

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)

Step 5: Verify all corner points satisfy all constraints

(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 ✓

Step 6: Determine boundedness

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

Corner Points: (0,0), (0,6), (2,4), (4,0)
Region: Bounded quadrilateral
Shape: Convex polygon
Final Answer:

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.

Applied Rules:

• Bounded Region: Enclosed area with finite extent

• Corner Points: Intersections of boundary lines

• Convexity: Line segment between any two points stays in region

2 Unbounded Feasible Region
Exercise 2
Find the feasible region for the system: x ≥ 0, y ≥ 0, and x - y ≥ 2. Identify corner points and determine if the region is bounded or unbounded.
Key Definitions:

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

Unbounded Region Analysis:

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

Constraints
\(x \geq 0, y \geq 0, x - y \geq 2\)
Region
Unbounded
Corner Point
(2, 0)
Step 1: Graph x ≥ 0 and y ≥ 0

These constraints restrict us to the first quadrant (including axes)

Boundary lines: x = 0 (y-axis) and y = 0 (x-axis), both solid lines

Step 2: Graph x - y ≥ 2

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)

Step 3: Find intersection with first quadrant

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

Step 4: Find corner points

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)

Step 5: Analyze the shape of the region

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

Step 6: Verify the region

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

Step 7: Determine boundedness

The region extends infinitely in the positive x direction

Therefore, the feasible region is UNBOUNDED

Corner Point: (2, 0)
Region: Unbounded
Extends: Infinitely rightward
Final Answer:

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.

Applied Rules:

• 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

3 Application Problem
Exercise 3
A company produces two products. Product A requires 2 hours of labor and 1 hour of machine time. Product B requires 1 hour of labor and 3 hours of machine time. The company has 10 hours of labor and 15 hours of machine time available daily. Each product A generates $3 profit and each product B generates $2 profit. Write the system of constraints, find the feasible region, and identify corner points.
Key Definitions:

Linear Programming: Optimization using systems of linear inequalities

Objective Function: Function to be maximized or minimized

Resource Constraints: Limits on available resources

Application Modeling:

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

Variables
\(x, y\)
Constraints
\(2x + y \leq 10, x + 3y \leq 15\)
Region
Bounded
Step 1: Define variables

Let x = number of units of Product A produced

Let y = number of units of Product B produced

Step 2: Write labor constraint

Product A: 2 hours per unit

Product B: 1 hour per unit

Total labor: 2x + y ≤ 10

Step 3: Write machine time constraint

Product A: 1 hour per unit

Product B: 3 hours per unit

Total machine time: x + 3y ≤ 15

Step 4: Add non-negativity constraints

Cannot produce negative units: x ≥ 0 and y ≥ 0

Step 5: Write complete system

2x + y ≤ 10 (labor constraint)

x + 3y ≤ 15 (machine time constraint)

x ≥ 0 (non-negativity)

y ≥ 0 (non-negativity)

Step 6: Find corner points

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)

Step 7: Verify all corner points

(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 ✓

System: 2x + y ≤ 10, x + 3y ≤ 15, x ≥ 0, y ≥ 0
Corner Points: (0,0), (0,5), (3,4), (5,0)
Region: Bounded quadrilateral
Final Answer:

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.

Applied Rules:

• Resource Constraints: Total usage ≤ available resources

• Non-negativity: Decision variables ≥ 0

• Bounded Region: Finite area with corner points

Feasible Region Types
\(\bigcap_{i=1}^{n} R_i\)
Intersection of Regions
✅
Bounded
Finite area, enclosed
♾️
Unbounded
Infinite extension
🎯
Corner Points
Boundary intersections
🔍
Empty
No solution exists
Region Characteristics

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

Bounded Region: Enclosed by finite boundary lines
Unbounded Region: Extends infinitely in one or more directions
\(x \geq 0, y \geq 0\)
Non-negativity Constraints
Comprehensive Feasible Region Summary
Core Definitions

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.

Bounded Region
Finite, enclosed area
Unbounded Region
Extends infinitely
Corner Points
Boundary intersections
Convexity
Line segments stay inside
Feasible Region Analysis Process:
  1. Identify all constraints: List all inequalities in the system
  2. Graph each constraint: Plot boundary lines and shade appropriate regions
  3. Find intersection region: Identify area satisfying all constraints
  4. Locate corner points: Find intersections of boundary lines
  5. Determine boundedness: Check if region extends infinitely
  6. Verify solutions: Test points in different regions
Tip 1: Corner points are found by solving pairs of boundary equations simultaneously.
Tip 2: For bounded regions, check that all constraints are satisfied at corner points.
Tip 3: Unbounded regions can still have optimal solutions in optimization problems.
Tip 4: The feasible region is always convex for linear constraints.
Common Mistakes: Forgetting constraints, incorrect shading, missing corner points.
Memory Aid: "All constraints must be satisfied simultaneously"
Student Questions & Expert Answers

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:

  1. Identify which boundary lines intersect at each corner
  2. Set the equations equal to each other
  3. Solve the resulting system of equations
  4. 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

📊
Bounded Regions

• Finite area

• Enclosed by constraints

• All corner points finite

• Can be circumscribed

Unbounded Regions

• Infinite extension

• May have corner points

• Extends infinitely

• Cannot be enclosed

Corner Points

• Boundary intersections

• Solve simultaneous equations

• Critical for optimization

• Extreme combinations

Convexity

• Line segments stay inside

• No indentations

• Always holds for linear

• Predictable shape

Analysis Process
1
List
2
Graph
3
Intersect
4
Analyze
Feasible Region Properties
Understanding boundedness, corner points, and optimization applications
Practice identifying bounded vs unbounded feasible regions!