Is a Bounded Dual Linear Program Indicator of a Feasible Primal?

flyingpig
Messages
2,574
Reaction score
1
Say I have a primal LOP K and a dual LOP D

If D is bounded, which means it is feasible, does that mean P is also bounded?

Because if P is unbounded, then D is infeasible

Likewise if D is unbounded, P is infeasible

So D is bounded, P is feasible? Make sense?
 
Mathematics news on Phys.org
You might get a response of you weren't so cryptic. LOP? Also you start out with things named K and D, but later you have P and D - I assume K and P are the same??
 
mathman said:
You might get a response of you weren't so cryptic. LOP? Also you start out with things named K and D, but later you have P and D - I assume K and P are the same??

They are. K = P, and D = D...

I don't know why I switched letters sorry for the confusion.
 
And LOP? I know what it means, but it would be helpful to other readers if you expanded this acronym once.
 
Linear Programming.

I actually do not know what the O stands for...

Sorry for the confusion.
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Back
Top