In this paper an algorithm to construct a D-optimal 2 k factorial design based on the work of (Hedayat & Pesotan, 2007) is developed and coded in a high level computer programming language, JAVA. Our algorithm is able to generate all possible square matrices of order (k + 2) from a 2 k by (k + 2) matrix, select all possible g(k, 1) design matrices of order (k + 2), and hence select a D-optimal design matrix. Furthermore, the computational formulas for the estimation of parameters for the 2 2 and 2 3 designs are derived. The results obtained by our algorithm agree with the theoretical results derived in.
Background: At the heart in the development of any organization or nation is human resource. Over the years the world over, a sharp increase in too many numbers of qualified persons is being experienced yearly. This has impacted on recruitment and promotion costs to increase immensely, thereby affecting negatively manpower system costs. Dynamic Programming (DP) approach to optimal manpower recruitment and promotion policies for the two grade system has been proposed. Methods: Considering the fact that contemporary manpower systems are not limited to just two grades -a kind of "switch-approach" to manpower systems, we first establish the link between a manpower planning problem and a dynamic decision-making process. This linkage resulted to a multistage real-life decision-making problem whose solution demands that decisions be made sequentially at different levels and at different points in time and space. Dynamic Programming is a mathematical technique well appropriate for the optimization of multistage decision problems. This allows us to give a generalization to manpower systems by modifying the model to finite grades which came out to be more robust and actionable, a constrained deterministic Dynamic Programming (CDDP) found to function computationally as the very well-known Wagner-Whitin Model in inventory/production management. Five cost variables associated with manpower planning were identified and used as inputs to the modified deterministic DP model. Results/Relevance: The data shows yearly recruitments and promotions totaling 507 and 266 staff respectively for a ten-period (year) planning horizon. Total manpower system cost (in ooo's of Nigerian Naira) occasioned by yearly recruitments and promotions exercises for the period is 11334 (7092 for recruiting, 4100 for promoting, and 142 for overstaffing). Our DP model minimizes the manpower system cost to 9462 making a significant reduction of 1872. The optimal policy for the planning period calls for recruiting and promoting respectively 79 and 41 in period 1 only, 86 and 24 in period 2 for periods 2 and 3, 86 and 46 in period 4 for periods 4 and 5, 89 and 29 in period 6 only, 85 and 70 in period 7 for periods 7 and 8, and 82 and 56 in period 9 for periods 9 and 10. The study will contribute to the growing literature on applications of OR models to problems in manpower planning. The model outcomes would provide the basis for evaluating decision policies aimed at conducting recruitment promptly and to eliminate over-stagnated promotions. Conclusion/Further research:We formulate decisions making in a finitely-graded manpower system as a multistage decision-making optimization problem which are best handled by dynamic programming. Five cost variables associated with manpower planning were identified and used as inputs to the modified deterministic DP model. Our model is resolute for minimizing manpower system costs occasioned by recruitments and promotions exercises in a wide range of multi-graded manpower systems instead of just two grades. The study's limit...
In this paper FRCA Solver for solving linear programming problems is presented. This software provides the computerized implementation of Feasible Region Contraction Algorithm (FRCA) developed by Effanga (2009). The solver which can solve linear programming problem of any size generates a sequence of interior feasible points that converges at the optimal solution. The solver is validated by using it to solve several linear programming problems one of which involves six bounded variables and three functional constraints presented in this paper. The solution obtains by the FRCA solver compared favorably with that of others software like MATLAB and OPTIMIZER.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.