DMCA
Program does not equal program: Constraint programming and its relationship to mathematical programming
Cached
Download Links
| Venue: | Interfaces |
| Citations: | 30 - 1 self |
BibTeX
@ARTICLE{Lustig_programdoes,
author = {Irvin J. Lustig and Jean-françois Puget},
title = {Program does not equal program: Constraint programming and its relationship to mathematical programming},
journal = {Interfaces},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Arising from research in the computer science community, constraint programming is a fairly new technique for solving optimization problems. For those familiar with mathematical programming, a number of language barriers make it difficult to understand the concepts of constraint programming. In this short tutorial on constraint programming, we explain how it relates to familiar mathematical programming concepts and how constraint programming and mathematical programming technologies are complementary. We assume a minimal background in linear and integer programming. G eorge Dantzig [1963] invented the simplex method for linear programming in 1947 and first described it in a paper entitled “Programming in a linear structure ” [Dantzig 1948, 1949]. Fifty years later, linear programming is now a strategictechnique used by thousands of businesses trying to optimize their global operations. In the mid-1980s, researchers developed constraint programming as a computer science technique by combining developments in the artificial intelligence community with the development of new computer programming languages. Fifteen years later, constraint programming is now being seen as an important technique that complements traditional mathematical programming technologies as businesses continue to look for ways to optimize their business operations. Developed independently as a technique within the computer science literature, constraint programming is now getting attention from the operations research com-
Keyphrases
constraint programming mathematical programming equal program linear programming simplex method computer science technique eorge dantzig familiar mathematical programming concept mathematical programming technology integer programming operation research com short tutorial language barrier computer science literature new technique business operation linear structure dantzig optimization problem global operation computer science community new computer programming language traditional mathematical programming technology artificial intelligence community minimal background important technique
