MHB No Optimal Explaining Formally

  • Thread starter Thread starter evinda
  • Start date Start date
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hello! (Wave)

There is given the following example of a linear programming problem that has no optimal solution.

View attachment 4813

$$\begin{Bmatrix}
a_{11}x_1+a_{12}x_2 \geq b_1 & \\
a_{21}x_1+a_{22}x_2 \geq b_2 &
\end{Bmatrix} \Leftrightarrow (x_1,x_2) \in D \\ \\ \\ \\ \ \ \max_{(x_1, x_2) \in D} (x_1+x_2)$$

How could we explain formally that there is no optimal solution? (Thinking)
 

Attachments

  • graph5.png
    graph5.png
    7.8 KB · Views: 82
Physics news on Phys.org
evinda said:
Hello! (Wave)

There is given the following example of a linear programming problem that has no optimal solution.

$$\begin{Bmatrix}
a_{11}x_1+a_{12}x_2 \geq b_1 & \\
a_{21}x_1+a_{22}x_2 \geq b_2 &
\end{Bmatrix} \Leftrightarrow (x_1,x_2) \in D \\ \\ \\ \\ \ \ \max_{(x_1, x_2) \in D} (x_1+x_2)$$

How could we explain formally that there is no optimal solution? (Thinking)

Hey evinda! (Smile)

Before we can do that, we need to know more about the $a_{ij}$.
Can we for instance assume that they are non-negative? (Wondering)
 
I like Serena said:
Hey evinda! (Smile)

Before we can do that, we need to know more about the $a_{ij}$.
Can we for instance assume that they are non-negative? (Wondering)

It holds that $a_{ij} \in \mathbb{R}, x_i \geq 0, i=1, \dots, n, b_j \geq 0, j=1, \dots, m$.
 
evinda said:
It holds that $a_{ij} \in \mathbb{R}, x_i \geq 0, i=1, \dots, n, b_j \geq 0, j=1, \dots, m$.

Let's pick $a_{ij} = -1, b_j = 0$ for every $i,j$.
Can you find an optimal solution for it? (Wondering)
 
I like Serena said:
Let's pick $a_{ij} = -1, b_j = 0$ for every $i,j$.
Can you find an optimal solution for it? (Wondering)

Then it has to hold that $x_1=x_2=0$ so the maximum is equal to $0$, right?

So under which conditions isn't there an optimal solution, given that we have an unbounded space? (Thinking)
 
evinda said:
Then it has to hold that $x_1=x_2=0$ so the maximum is equal to $0$, right?

So under which conditions isn't there an optimal solution, given that we have an unbounded space? (Thinking)

Yes. (Nod)

Either when there is no solution at all, or when the solution space is unbounded in the direction of increasing value. (Thinking)

Suppose we start with 1 boundary condition.
For which angles of the line of the boundary condition will there be no feasible solution?
And for which angles will the maximum be unbounded? (Wondering)
 
Namaste & G'day Postulate: A strongly-knit team wins on average over a less knit one Fundamentals: - Two teams face off with 4 players each - A polo team consists of players that each have assigned to them a measure of their ability (called a "Handicap" - 10 is highest, -2 lowest) I attempted to measure close-knitness of a team in terms of standard deviation (SD) of handicaps of the players. Failure: It turns out that, more often than, a team with a higher SD wins. In my language, that...
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Back
Top