Each objective attains its optimum
Lax330177.OptimaExist · concepts/Lax330177/OptimaExist.lean · lax-330177
No public endorsements yet.
Loading review…
Sign in with ORCIDNatural Language Statement
Theorem
Fix the endpoints, traversal times, release time and arrival deadline. If at least one feasible path exists, then each of the five criteria has an optimal path. The optimizing path may depend on the criterion.
Concept map
Lean source view on GitHub
| 1 | import Lax330177.OptimalPaths |
| 2 | |
| 3 | /-! |
| 4 | --- |
| 5 | title: Each objective attains its optimum |
| 6 | type: theorem |
| 7 | --- |
| 8 | Fix the endpoints, traversal times, release time and arrival deadline. If at least one feasible path exists, then each of the five criteria has an optimal path. The optimizing path may depend on the criterion. |
| 9 | |
| 10 | [Read the proof.](Lax330177Proofs.OptimalPaths.optima_exist.html) |
| 11 | -/ |
| 12 | namespace Lax330177.OptimaExist |
| 13 | open Lax330177.Representations Lax330177.Durations |
| 14 | open Lax330177.OptimalPaths |
| 15 | variable {n : ℕ} {G : Graph n} {q : Query G} |
| 16 | |
| 17 | axiom optima_exist (h : Nonempty (Candidate q)) : |
| 18 | (∃ p : Candidate q, Shortest p) ∧ (∃ p : Candidate q, Fastest p) ∧ |
| 19 | (∃ p : Candidate q, Foremost p) ∧ (∃ p : Candidate q, LatestDeparture p) ∧ |
| 20 | (∃ p : Candidate q, MinimumWaiting p) |
| 21 | end Lax330177.OptimaExist |
| 22 |
Discussion
Ask a question or add context. Endorsements and structured flags are kept in the review panel above.
0 comments