Abstract
Properties of the idempotently convex hull of a two-point set in a free semimodule over the idempotent semiring R max min and in a free semimodule over a linearly ordered idempotent semifield are studied. Construction algorithms for this hull are proposed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
V. P. Maslov, Asymptotic Methods of Solution of Pseudodifferential Equations [in Russian], Nauka, Moscow, 1987.
F. L. Bacelli, G. Cohen, G. J. Olsder, and J. P. Quadrat, Synchronization and Linearity: an Algebra for Discrete Event Systems, John Wiley & Sons Publ., New York, 1992.
V. P. Maslov and V. N. Kolokol'tsov, Idempotent Analysis and Its Application in Optimal Control [in Russian], Nauka, Moscow, 1994.
V. P. Maslov and S. N. Samborskii (editors), Idempotent Analysis, Adv. Sov. Math, vol. 13, Amer. Math. Soc., Providence, RI, 1992.
J. Gunawardena (ed.), Idempotency, Publ. of the Newton Institute, Cambridge Univ. Press, Cambridge, 1998.
G. L. Litvinov and V. P. Maslov, Correspondence Principle for Idempotent Calculus and Some Computer Applications, (IHES/M/95/33), Institut des Hautes Etudes Scientifiques, Bures-Sur-Yvette, 1995.
G. L. Litvinov, V. P. Maslov, and G. B. Shpiz, “Idempotent Functional Analysis. Algebraic Approach, ” Mat. Zametki [Math. Notes], 69 (2001), no. 5, 758–797.
K. Zimmermann, “A general separation theorem in extremal algebras, ” Ekonomicko-matematicky obzor (Prague), 13 (1977), no. 2, 179–201.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Sergeev, S.N. Algorithmic Complexity of a Problem of Idempotent Convex Geometry. Mathematical Notes 74, 848–852 (2003). https://doi.org/10.1023/B:MATN.0000009021.18823.52
Issue Date:
DOI: https://doi.org/10.1023/B:MATN.0000009021.18823.52