|
Article information
1998 , Volume 3, ¹ 2, p.45-54
Telerman V.V., Ushakov D.M.
Constraint satisfaction in mathematical programming problems
A number of problems to be solved can be formalted as Constraint Satisfaction Problems (CSP). Subdefinite models are the powerful apparatus for solving such problems.
The solving means the searching outer estimation of the set of all solutions of CSP. In the paper a modification of the apparatus is considered, which let one to solve the problem of finding the optimal solution of CSP, i. e.
mathematical programming problem.
[full text] Classificator Msc2000:- *65G30 Interval and finite arithmetic
- 65K05 Mathematical programming
- 90C05 Linear programming
Classificator Computer Science:- *G.1.0 General (Numerical Analysis)
- G.1.6 Optimization
Keywords: constraint satisfaction problem, mathematical programming, subdefinite computations, interval analysis, linear programming
Author(s):
Telerman Vitaly Vasilievich
PhD.
Position: Senior Research Scientist
Office: Informatics System Institute SB RAS
Address: 630090, Russia, Novosibirsk, Ac. Lavrentiev ave., 6
Phone Office: (3832)352961
E-mail: telerman@iis.nsk.su
Ushakov Dmitrii Mikhailovich
PhD.
Office: Russian research institute of artificial intelligence
Address: 630090, Russia, Novosibirsk, Ac. Lavrentiev ave., 6
E-mail: ushakov@iis.nsk.su
Bibliography link:
Telerman V.V., Ushakov D.M. Constraint satisfaction in mathematical programming problems // Computational technologies. 1998. V. 3. ¹ 2. P. 45-54
|
|
|
|
