1 Explicit constraints:

Explicit constraints are rules that restrict each Xi to take values only from a given
set.
Some examples are,

Xi 0 or Si = {all non-negative real nos.}
Xi =0 or 1 or Si={0,1}.

Li Xi Ui or Si= {a: Li a Ui}

All tupules that satisfy the explicit constraint define a possible solution space for I.

2) explains Tuple (Database)

In mathematics, a tuple is an ordered list of elements. Related to this is an n-tuple, which in set
theory is a collection (sequence) of "n" elements. Given this, it might be more properly said that
tuples are implemented as records even though the terms are commonly used interchangeably.
The traveling salesman problem is a problem in graph theory requiring the most efficient (i.e., least total
distance) Hamiltonian cycle a salesman can take through each of cities. No general method of solution is known,
and the problem is NP-hard.

Bounded functions

In mathematics, a function f defined on some set X with real or complex values

is called bounded, if the set of its values is bounded. In other words, there exists a
real number M such that. ... A function that is not bounded is said to be unbounded.

NQueeens problem
The 8-Queens problem on a chessboard corresponds to finding a placement of 8 queens such that
no queen attacks any other queen. This means that 1. No two queens can be on the same column.
2. No two queens can be on the same row. 3. No two queens can be on the same diagonal.

Non deterministic algorithm

In computer science, a nondeterministic algorithmis an algorithm that, even for the
same input, can exhibit different behaviors on different runs, as opposed to
a deterministic algorithm. ... Aprobabilistic algorithm's behaviors depends on a
random number generator.