Certificates of unboundedness
Lax109476.RecessionDirection · concepts/Lax109476/RecessionDirection.lean · lax-109476
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Definition
An improving recession direction satisfies
Together with any primal feasible point , it certifies unboundedness: is feasible for every and its objective tends to infinity.
Concept map
Lean source view on GitHub
| 1 | import Lax109476.LinearProgram |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Certificates of unboundedness |
| 6 | type: definition |
| 7 | --- |
| 8 | An improving recession direction satisfies |
| 9 | |
| 10 | Together with any primal feasible point , it certifies unboundedness: |
| 11 | is feasible for every and its objective tends to infinity. |
| 12 | |
| 13 | # Formalization notes |
| 14 | |
| 15 | A direction alone does not certify that the primal is unbounded: the |
| 16 | feasible set could be empty. Certificates therefore include a feasible |
| 17 | base point as well as the direction. |
| 18 | -/ |
| 19 | |
| 20 | namespace Lax109476.RecessionDirection |
| 21 | |
| 22 | open Lax109476.LinearProgram |
| 23 | |
| 24 | /-- A nonnegative direction preserves every upper constraint and improves |
| 25 | the maximized objective. -/ |
| 26 | def IsImprovingDirection {K : Type} [Ring K] [PartialOrder K] {m n : ℕ} |
| 27 | (P : Program K m n) (d : Fin n → K) : Prop := |
| 28 | (∀ j, 0 ≤ d j) ∧ (∀ i, rowValue P d i ≤ 0) ∧ 0 < primalValue P d |
| 29 | |
| 30 | end Lax109476.RecessionDirection |
| 31 |
Formalization notes
A direction alone does not certify that the primal is unbounded: the feasible set could be empty. Certificates therefore include a feasible base point as well as the direction.
Builds on
From Mathlib
none
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments