Properties of the idempotently convex hull of a two-point set in a free semimodule over the idempotent semiring Rmax min and in a free semimodule over a linearly ordered idempotent semifield are studied. Construction algorithms for this hull are proposed. Some asymptotic physical problems (such as quasiclassical approximation in quantum mechan- ics (1)), as well as many problems of optimization theory, mathematical economics, etc., admit a natural and simple formulation in terms of algebraic structures involving the operations of mini- mization or maximization (2, 3). Such algebraic structures are the object of the actively developing field of idempotent mathematics (3-5). Interesting, important and useful constructions and re- sults of traditional mathematics over number fields and similar structures have counterparts over idempotent semifields and semirings formulated in the spirit of Bohr's correspondence principle in quantum theory (6, 7). This correspondence can be far from obvious, though. In this paper, we consider the simplest problem of idempotent convex geometry (developed, in particular, in (8) and (7)), the construction of the convex hull of a two-point set in an idempotent semimodule, and prove that the algorithmic complexity of its solution increases with the growth of the semimodule's dimension. We consider the number line with the operations ⊕ = max and � = + and the additional element −∞, which plays the part of 0, i.e., is assumed to have the properties −∞ ⊕ a = a, −∞ � a = −∞. The ⊕ operation is commutative, associative, and idempotent ( a ⊕ a = a), the � operation is commutative and distributive with respect to ⊕. In idempotent analysis, the above- mentioned properties are considered to be the axioms of an idempotent semiring. The structure defined above has also the property of invertibility of theoperation and, for that reason, is called the idempotent semifield Rmax +. The idempotent semiring Rmax min is an important example of a semiring which is not a semi- field. It includes the entire number line with the additional elements −∞ and +∞ and has two operations ⊕ = max and � = min. The elements −∞ and +∞ are considered to be the elements 0 and 1 of the semiring, i.e., are assumed to have the properties −∞ ⊕ a = a, a � (+∞ )= a. In any idempotent semiring, the ⊕ operation induces a partial order: ab if and only if a ⊕ b = b; a ≺ b if and only if ab and ab. In both semirings considered above, this order is linear, because for any elements a and b ,w e haveab or ba; therefore, for any elements a and b of these semirings the operation a ∧ b of taking the lower bound is also defined. In the paper, we consider semimodules S n of column vectors of the form (a 1 , . .. ,a n ), a i ∈ S, with coordinatewise operations of generalized addition and multiplication by a scalar from the