Understanding Geometric Meaning of Ax≤b

  • Context: Graduate 
  • Thread starter Thread starter EngWiPy
  • Start date Start date
Click For Summary

Discussion Overview

The discussion centers around the geometric interpretation of the inequality \(\mathbf{A}\mathbf{x} \leq \mathbf{b}\) in the context of linear programming and polyhedra. Participants explore how this relates to constraints in optimization problems, particularly in the context of maximizing the volume of a rectangle within a defined polyhedron.

Discussion Character

  • Exploratory
  • Technical explanation
  • Conceptual clarification
  • Homework-related

Main Points Raised

  • Some participants suggest that the inequality \(\mathbf{A}\mathbf{x} \leq \mathbf{b}\) defines a polyhedral set that restricts the possible values of \(\mathbf{x}\) to its interior, relating this to practical examples like sandwich making.
  • There is a proposal that the intersection of hyperplanes defined by the constraints forms the polyhedron.
  • A participant references a homework problem involving maximizing the volume of a rectangle within a polyhedron and raises questions about the dimensions of the rectangle and the nature of the constraints provided in the solution.
  • Questions are posed regarding the reasoning behind the objective function's formulation and the derivation of the constraints in the context of the problem.

Areas of Agreement / Disagreement

Participants generally agree on the geometric interpretation of the constraints as defining a polyhedron, but there are unresolved questions regarding the specific formulation of the optimization problem and the constraints involved.

Contextual Notes

Limitations include the lack of clarity on the derivation of the constraints and the implications of the power of \(1/n\) in the objective function, which remain unexplored in the discussion.

EngWiPy
Messages
1,361
Reaction score
61
Hi,

Suppose we have [tex]m\times n[/tex] matrix [tex]\mathbf{A}[/tex], and [tex]n\times 1[/tex] column vector [tex]\mathbf{x}[/tex]. Then what do we mean by:

[tex]\mathbf{A}\mathbf{x}\leq \mathbf{b}[/tex]

geometrically?

Thanks in advance
 
Physics news on Phys.org
It looks like the constraint system if a linear program. The system in most cases defines a polyhedral (that can be shown to be convex) that restricts x to its interior. This occurs in many areas such as sandwich making, in that case we can make n types of sandwiches, we are constained by m conditions on our sandwiches such as our available mustard or number of lemon peal sandwich rolls. We can visualize our posible set of sandwiches by a polyhedra.
 
lurflurf said:
It looks like the constraint system if a linear program. The system in most cases defines a polyhedral (that can be shown to be convex) that restricts x to its interior. This occurs in many areas such as sandwich making, in that case we can make n types of sandwiches, we are constained by m conditions on our sandwiches such as our available mustard or number of lemon peal sandwich rolls. We can visualize our posible set of sandwiches by a polyhedra.

So, the intersection of all these planes is the polyhedron?
 
Yes, in general they can be hyper planes.
 
lurflurf said:
Yes, in general they can be hyper planes.

Ok thank you
 
Dr. Boyd at Stanford University, says the following in the solution of a homework: The question is: find the maximum volume rectangle [tex]\mathbf{R}=\{\mathbf{x}:\mathbf{l}\leq\mathbf{x}\leq\mathbf{u}\}[/tex] in a polyhedron [tex]\mathbf{P}=\{\mathbf{x}:\mathbf{A}\mathbf{x}\leq\mathbf{b}\}[/tex].

He says that, an efficient solution would be:

[tex]\text{max }\left(\prod_{i=1}^n\left(u_i-l_i\right)\right)^{1/n}[/tex]
[tex]\text{Subject to }\sum_{i=1}^n\left(a_{ij}^+u_j-a_{ij}^-l_j\right)\leq b_i,\,\,\text{ for }i=1,2,\ldots,n[/tex]
where [tex]a_{ij}^+=\text{max}\{a_{ij},0\}[/tex] and [tex]a_{ij}^-=\text{max}\{-a_{ij},0\}[/tex].

Here I have a couple of questions:

1- I assume that [tex]u_i-l_i[/tex] are the dimensions of the rectangle, and so, the volume will be the product of these dimensions, right? Then why we have the power of [tex]1/n[/tex] in the objective function?

2- How did he get the constraint? and why?

Any help in these two questions will be highly appreciated.

Thanks
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 11 ·
Replies
11
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 1 ·
Replies
1
Views
794
Replies
3
Views
1K