Institutional Repository

Browsing College of Science, Engineering and Technology by Subject "Linear programming"

Browsing College of Science, Engineering and Technology by Subject "Linear programming"

Sort by: Order: Results:

  • An AI search algorithm to obtain the shortest simplex path 
    Scott, TG; Hattingh, J.M.; Steyn, T (South African Computer Society (SAICSIT), 1996)
    The simplex method is one way of solving a linear programming problem (LP-problem). An A* search algorithm based on a certain evaluation function has been developed to obtain the shortest path to an optimal solution within ...
  • The construction of optimal drape surfaces with constrained first and second derivatives 
    Fossati, Reiner Justin (2003-01)
    The need to construct optimal drape surfaces arises in airborne geophysical surveys where it is necessary to fly a safe distance above the ground and within the performance limits of the aircraft used, but as close as ...
  • An efficient primal simplex implementation for the continuous 2-matching problem 
    Smith, THC; Meyer, TWS; Leenen, L (South African Institute of Computer Scientists and Information Technologists, 1991)
    The continuous 2-matching problem {RMP2) is the relaxation of the symmetric travelling salesman problem {STSP) used by Padberg & Rinaldi to develop a highly successful branch-and-cut algorithm for the STSP. ...

Search UnisaIR


Browse

My Account