AI and OR approaches have complementary strengths: AI in domain-specific knowledge representation and OR in efficient mathemat:ical computation. Constraint Logic Programming (CLP), which combines these complementary strengths of the AI and OR approach, is introduced as a new tool to formalize a special class of constraint satisfaction problems that include both qualitative and quantitative cons...

In this paper we present a generalization of the predictor corrector method of linear programming problem to semideenite linear programming problem. We consider a direction which, we show, belongs to a family of directions presented by Kojima, Shin-doh and Hara, and, one of the directions analyzed by Monteiro. We show that starting with the initial complementary slackness violation of t 0 , in ...

In computability theory, program self-reference is formalized by the not-necessarily-constructive form of Kleene’s Recursion Theorem (krt). In a programming system in which krt holds, for any preassigned, algorithmic task, there exists a program that, in a sense, creates a copy of itself, and then performs that task on the self-copy. Herein, properties complementary to krt are considered. Of pa...

Evolutionary programming is the most powerful method for inducing recursive functional programs from input/output examples while taking into account efficiency and complexity constraints for the target program. However, synthesis time can be considerably high. A strategy which is complementary to the generate-and -test based approaches of evolutionary programming is inductive analytical program...

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 pro...

We study a deterministic linear quadratic LQ control problem over an in nite horizon without the restriction that the control cost matrix R or the state cost matrix Q be positive de nite We develop a general approach to the problem based on semi de nite programming SDP and related duality analysis We show that the complementary duality condition of the SDP is necessary and su cient for the exis...

In this paper we deal with sensitivity analysis in convex quadratic programming, without making assumptions on nondegeneracy, strict convexity of the objective function, and the existence of a strictly complementary solution. We show that the optimal value as a function of a right{hand side element (or an element of the linear part of the objective) is piecewise quadratic, where the pieces can ...