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
Main Article Content
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.
Article Details
This is an Open Access article distributed under the terms of the Attribution-Noncommercial 4.0 International License [CC BY-NC 4.0], which requires that reusers give credit to the creator. It allows reusers to distribute, remix, adapt, and build upon the material in any medium or format, for noncommercial purposes only.