recategorized
1,768 views
3 votes
3 votes

In constraint satisfaction problem, constraints can be stated as

  1. Arithmetic equations and inequalities that bind the values of variables
  2. Arithmetic equations and inequalities that does not bind any restriction over variables
  3. Arithmetic equations that impose restrictions over variables
  4. Arithmetic equations that discard constraints over the given variables
recategorized

2 Answers

2 votes
2 votes
Answer A

remember map coloring problem, it is a Constraint satisfaction problem.

We need mathematical equations and inequalities. So C and D are not the answer.

Inequalities are must to check whther constraintes are fullfilled.

Equation specify the constarint.

In a nutshell, A should be the proper choice
2 votes
2 votes
clearly ans is A  constraints satisfaction probems like cryptoarithmetic  problem(e.g. CROSS +ROAD =DANGER or SEND+MORE=MONEY) bind values of alphabets from 0 to 9  and there are equations and inequality which imposes these restrictions
Answer:

Related questions

3 votes
3 votes
1 answer
1
go_editor asked Aug 11, 2016
5,487 views
Consider the following transportation problem:The transportation cost in the initial basic feasible solution of the above transportation problem using Vogel's Approximati...
1 votes
1 votes
1 answer
3
go_editor asked Aug 11, 2016
14,491 views
A basic feasible solution of a linear programming problem is said to be ______ if at least one of the basic variable is zerogeneratedegenerateinfeasibleunbounded