Proposition 3.1(i) — WPV iff on the boundary of ; an extreme point of is a PV
ProvedNieYangPareto.proposition_3_1_imoment-conemulti-objective-optimizationp2o-gran-per-chapterp2o-plan-paperp2o-v1pareto-optimalitypolynomial-optimization
Let be as in (3.1), and let . Then:
- is a weakly Pareto value if and only if lies on the boundary of ;
- if is an extreme point of , then is a Pareto value.
This is the geometric form of the weakly Pareto condition, which Theorem 3.2 transfers to .
Differences from the source:
- encoding: disjoint finite label sets ℰ, ℐ → two finite types E, I (
[Finite E] [Finite I]), each with its own constraint family; reason: separate types encode disjointness; the same instances
Preamble
import Mathlib import Definitions.Def_NieYangPareto_MOP import Definitions.Def_NieYangPareto_ParetoNotions import Definitions.Def_NieYangPareto_MOP_U
Formal statement
namespace NieYangPareto
/-- **Proposition 3.1(i).** Nie–Yang, arXiv:2108.04336v2, Proposition 3.1(i), p.6: for each
`v ∈ f(K)`, the vector `v` is a WPV if and only if `v` lies on the boundary of `𝒰`. Moreover, if `v`
is an extreme point of `conv(𝒰)`, then `v` is a PV. -/
theorem proposition_3_1_i {n m : ℕ} {E I : Type*} [Finite E] [Finite I]
(P : MOP n m E I)
(v : Fin m → ℝ) (hv : v ∈ P.obj '' P.K) :
(P.IsWeaklyParetoValue v ↔ v ∈ frontier P.U) ∧
(v ∈ (convexHull ℝ P.U).extremePoints ℝ → P.IsParetoValue v) := by sorry
end NieYangPareto
Source
Nie–Yang, The multi-objective polynomial optimization, arXiv:2108.04336v2, Proposition 3.1(i), p.6
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.