Our system is currently under heavy load due to increased usage. We're actively working on upgrades to improve performance. Thank you for your patience.
1978
DOI: 10.1002/mana.19780810116
|View full text |Cite
|
Sign up to set email alerts
|

Necessary and Sufficient Conditions for the Order‐ Completeness of Partially Ordered Vector Spaces

Abstract: The HAHN-BANACH-theorem is known to have fundamental importance for several fields of mathematics. This theorem is not used concerning functionals, but operators which map into a real partially ordered vector space.In this paper is shown that the validity of this theorem is equivalent t o the validity of various well known propositions of mathematical programming and of partially ordered vector spaces and of operator-inequalities. Among these propositions, for instance, we find the F~~~a s -M~~~o w s~~-t h e o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
7
0

Year Published

1978
1978
2020
2020

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 7 publications
2
7
0
Order By: Relevance
“…In this paper, we extend to linear and equivariant vector lattice-valued operators the earlier results proved in [23,[47][48][49] in the linear case and in [6] in the invariant setting on Hahn-Banach, sandwich and extension theorems, Fenchel-type duality theorems, Moreau-Rockafellar formula, subdifferential calculus, Farkas and Kuhn-Tucker theorems on convex optimization under constraints. Furthermore, we prove the equivalence of given theorems with amenability.…”
Section: Introductionmentioning
confidence: 86%
“…In this paper, we extend to linear and equivariant vector lattice-valued operators the earlier results proved in [23,[47][48][49] in the linear case and in [6] in the invariant setting on Hahn-Banach, sandwich and extension theorems, Fenchel-type duality theorems, Moreau-Rockafellar formula, subdifferential calculus, Farkas and Kuhn-Tucker theorems on convex optimization under constraints. Furthermore, we prove the equivalence of given theorems with amenability.…”
Section: Introductionmentioning
confidence: 86%
“…Moreover, the KUHN-TUCKER conditions may hold without ordcr-completeness of F, if other parts of the problem are suitably restricted. Also duality and related tlicorcnis iiiay hold, as shown below, when (unlike [$I, [9]) different ordering cones are used for the given (primal) pi*obIcni and its vector dual.…”
Section: )mentioning
confidence: 99%
“…It is known that the HAHN-BAxACH-Theorem (without the assumption of the (lubp) of F) follows from each of Theorem 1, Theorem 3, Theorem 4 andTheorem 5 where for such conclusions the (lubp) of F is also not used (see [5], [6], [S]) Therefore, the least upper bound property of F is necessary for each of these statements.…”
Section: Some Applicationsmentioning
confidence: 99%