On Topological Fixed Point Iteration Methods and the Optimization Simplex Algorithm in the Flight Attendants’ Hiring and Training Problem of the South African Airways On Topological Fixed Point Iteration Methods and the Optimization Simplex Algorithm in the Flight Attendants’ Hiring and Training Problem of the South African Airways

Abstract

This research aims at generating the topological fixed point iteration scheme for the simplex method of Linear Programming problems in optimization as exemplified in the optimization of the flight attendants’ hiring problems of South African Airways Company displayed in the latter part of section two. Review of basic related concepts of the linear programming and flight attendant’s problems were discussed in sections one and early part of section two while main results boarding on the iterative schemes we discussed in section three.