The following paper considers possibility using nondeterministic algorithms in optimization problems. The usually definition, an algorithm is a finite set of instructions that, if followed, accomplishes a particular task. It is so-called deterministic algorithm. In a theoretical framework can be remove this restriction on the outcome of every operation. We can allow algorithms to contain operations whose outcomes are not uniquely defined but are limited to specified sets of possibilities. The algorithm executing such operations is allowed to choose any one of this outcome's subject. This leads to concept of a nondeterministic algorithm. This concept is considered in the genetic algorithms, because genetic algorithms are used in the optimization mainly. For this reason is giving short describe for the genetic algorithms.