ON THE TOPOLOGICAL PICARD'S FIXED POINT ITERATIVE ALGORITHM FOR THE SIMPLEX METHOD OF OPTIMIZATION

C. E. EZIOKWU

Abstract


This research aims at generating the topological fixed point iterative scheme for the simplex method of linear programming problems in optimization as exemplied in the optimization of the flight attendants' hiring problem of the Nigerian Airways company displayed in section three. The generated main result in section two reaffirms that the traditional simplex
method reviewed in section one is the Picard's fixed point iterative method which is seen illustrated in section three.

Full Text:

PDF

References


Siddiqi A.H. (2004) "Applied Functional Analysis (Numerical Methods,

Wavelet Methods and Image Processing)"; Marcel Dekker Inc. New York, Basel USA

Bender, E.A. (2000)"An introduction to Mathematical Modelling"; John Wiley, New York

Beveridge, G.S.G. and R. Schechter, (1970) "Optimization theory and Practice"; McGraw-Hill, New York

Boggs P.T.R, H Byrds and R.B. Schnabel, (1985)"Numerical Optimiza-

tion"; SIAM Piladelphia

Brent, R.P, (1973)"Algorithms for Mi nimization without Derivatives";

Prentice-Hall, Eaglewood Cliffs, New York

Dantzig, G.B, (1998) "Linear Programming and Extensions"; Princeton NJ


Refbacks

  • There are currently no refbacks.


Copyright (c) 2019 Journal of the Nigerian Mathematical Society

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.