الآن تُعرض المواد 1 -- 9 من 9

    • A comparative analysis of some methods for solving quadratic programming problems 

      Zaghloul, Fathia; Zolfa, Shalabi (The Institute of National Planning, 1988-02)
      The problem of quadratic programming is that of minimizing a convex function subject linear constraints. It is one of the simplest cases of nonlinear programming.
    • Expert systems 

      El Daoushy, Abdalla (The Institute of National Planning, 1993-09)
      At present, the most important application areas of Artificial Intelligence (AI) would be centered on knowledge engineering. and ,more particularly, on Expert Systems (ESs). Today, ESs are used in business, science, ...
    • A geometrical proof for the duality theorem in linear programming 

      El-Kafrawy, M. (The Institute Of National Planning., 1980-07)
      In surveying the literature which has been written since 1945, the year when Herbert A. Simon's Administrative Behavior was first edited, it becomes apparent that there is a linkup between Simon's theory and empirical ...
    • An integer programming model for solving the problem of school timetable 

      Ahmed, Ahmed Mustafa; Supervised by Abdalla El Daoushy (The Institute of National Planning, 2006-01)
      In this paper we presented a new IP formulation of a timetabling problem as it appears in many universities, but hear we focus on the school timetabling, adding however many features that may be characterized many timetable ...
    • lectures on: Cobol programming language 

      El-daoushy, Abdalla (1984-03)
      These lectures deal with the cobol language, the common business oriented language. A language designed for use in business applications. Cobol is in fact the most widely used language in computer world today. It is ...
    • A method for local and global minimization of concave function under linear consraints 

      Omar, Amani (The Institute Of National Planning., 1981-02)
      Global optimization involves solving mathematical programming problems that may have distinct local optima. In this paper, I present a method for locating a global minimum (maximum) of a concave (convex) function subjected ...
    • A Programming Approach the Problem of Supply Response./ اسلوب البرمجة لمشكلة الاستجابة للعرض 

      Mohaya A. Zaytoun. (INP., 8-1975.)
      This study reviews the primary methodologies used in the analysis of agricultural supply response. Empirical research in this field generally falls into two main categories: econometric analysis and mathematical programming. ...
    • A programming method for Quasi and explicitly Quasi-concave minimum programming problem 

      Omar, Amani (The Institute Of National Planning., 1981-03)
      In the fifties, the theory of nonlinear programming was almost limited to problems in which the consraints and the objective functions were convex. In the sixties, it was gradually recognized that for most of the theorems ...
    • Solving Salesperson Problem with Artificial Intelligence Techniques 

      El-Daoushy, Abdalla (The Institute of National Planning, 1994-03)
      Operations research (DR) problems have been solved by the well-known mathematical algorithms and the conventional programming languages such as FORTRAN, PASCAL, ...etc. This memo. is ‘concerned with solving some DR problems ...