Constraints of an L-shaped feasible region

  • Context: High School 
  • Thread starter Thread starter Jimbrisky
  • Start date Start date
  • Tags Tags
    Constraints
Click For Summary
SUMMARY

The discussion focuses on defining the constraints for an L-shaped feasible region in optimization problems. The correct constraints are identified as the union of two sets: R1, defined by the inequalities –1 ≤ x ≤ 1 and 0 ≤ y ≤ 1, and R2, defined by 0 ≤ x ≤ 1 and -1 ≤ y ≤ 0. The initial proposed constraints were insufficient as they only described a rectangular area, not the complete L-shaped region. The use of proper notation and naming conventions for the sets is also emphasized for clarity.

PREREQUISITES
  • Understanding of optimization problems and feasible regions
  • Familiarity with mathematical notation for inequalities
  • Basic knowledge of set theory and unions
  • Experience with MATLAB or similar optimization tools
NEXT STEPS
  • Study the concept of feasible regions in linear programming
  • Learn about set notation and its applications in mathematics
  • Explore MATLAB's optimization toolbox for practical applications
  • Investigate the implications of constraints on optimization solutions
USEFUL FOR

Mathematicians, optimization analysts, students in operations research, and anyone involved in formulating constraints for optimization problems.

Jimbrisky
Messages
3
Reaction score
0
I am writing the constraints for the feasible region within the L-shaped feasible region. The diagram is at this http://www.mathworks.com/help/optim/ug/writing-constraints.html

Are these equations the right constraints:

–1 ≤ x ≤ 1 and 0 ≤ y ≤ 1

Thanks for the help.
 
Mathematics news on Phys.org
Jimbrisky said:
I am writing the constraints for the feasible region within the L-shaped feasible region. The diagram is at this http://www.mathworks.com/help/optim/ug/writing-constraints.html

Are these equations the right constraints:

–1 ≤ x ≤ 1 and 0 ≤ y ≤ 1
No. These inequalities give you the rectangle whose corners are at (-1, 1), (1, 1), (1, 0), and (-1, 0). To get the whole L-shaped region you also need these constraints: 0 ≤ x ≤ 1 and -1 ≤ y ≤ 0.

The diagram at the page you linked to says this (slightly changed to use your x, y notation):

A point is in the rectangle –1 ≤ x ≤ 1 and 0 ≤ y ≤ 1 OR a point is in the rectangle 0 ≤ x ≤ 1 and -1 ≤ y ≤ 0
 
@Mark44, based on your explanation can I write the constraints for the feasible region as the union of two sets, Rx∪Ry, where

Rx:={(x,y):−1≤x≤1,0≤y≤1}

Ry:={(x,y):0≤x≤1,−1≤y≤1}.

Thanks for the help.
 
Yes, although I don't know why you call one set Rx and the other one Ry. Better names might be R1 and R2.
 
  • Like
Likes   Reactions: Jimbrisky

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
Replies
1
Views
3K
  • · Replies 14 ·
Replies
14
Views
1K
  • · Replies 20 ·
Replies
20
Views
3K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K