The Transportation Problem which deals with the distribution of commodities from a variety of sources to a variety of destinations was considered in this research. In this work, existing theorems such as the duality theorems and complementary slackness theorem were used to analyse the transportation problem and their applicability was observed. Illustration was made with data gathered from a real-life production company (Owerri, Port-Harcourt and Enugu plants). The data collected was modeled as a Linear Programming Problem of the transportation type and solved with TORA optimization software (VAM-MODI Method) to generate an optimal and feasible solution. It was observed that the cost of transportation of finished Returnable Glass Bottle products of the company for a month was in general reduced by 11.58%.
In this Research article we prove the following results: 1. The crown graph Cn⊙ K1 is V4-cordial for all n. 2. The armed crown ACn is V4-cordial for all n. 3. The pan graph Cn+1 is V4-cordial for all n. 4. The corona graph Cn⊙ mK1 is V4-cordial for all n and m.
Traffic saturation in both pedestrian and vehicular situations is common on all the principal streets of Sekondi-Takoradi Metropolis. The situation has become to a large extent unbearable to the inhabitants of the city. In the study, the following surveys were conducted: Manual Classification Count, Intersection Count, Screenline Classification Count, Parking Studies, Pedestrian Studies, Travel Time Studies, Mode of Travel and Waiting Times Surveys. The study revealed that traffic variation factors were almost the same at the designated classified Stations, Agona Nkwanta Road recorded the highest vehicular traffic during the AM and PM peak periods, and the busiest intersection during the AM peak period was the Sekondi Road / Takoradi Polytechnic Road. The highest pedestrian AM hourly volume of 2861ped/hr was recorded at Ashanti Road. The Ahanta Road registered the highest (2662 ped/hr) in pedestrian volume for the PM peak period. The highest Congestion Severity Index of 65.74 minutes delay per kilometer travelled and 86.82 minutes delay per kilometer travelled were identified for the AM and PM peak periods respectively at the Takoradi Market Circle Round About. Buses were the frequently used mode of transport for most commuters in the city.
In this paper, a new reliable algorithm, multistage Laplace Adomian decomposition method (MLADM) based on standard Laplace – Adomian method, is presented to solve a time- fractional financial model for both chaotic and non- chaotic. The new algorithm is just a simple modification of Laplace- Adomian method (LAM). This method is considered as an algorithm in a sequence of small intervals for obtaining accurate approximate solutions. The study depicts that the LADM provides reliable results for t ˂˂ 1. Numerical comparisons between the MLADM and the classical Runge- Kutta fourth order method (RK4) in the case of integer-order derivatives solutions indicates that the MLADM gives better output with high accuracy and is a promising technique for nonlinear systems of integer and fractional order.
A new technique of the Mickens iterative method has been presented to obtain approximate analytic solutions of the Inverse Cubic Truly Nonlinear Oscillator. In this paper, we have used Fourier series and utilized truncated terms in each steps of iteration. The method is illustrated by an example and the solutions obtained by this method agree nicely with the exact frequency. Also the solutions give more accurate result than other existing results and the method is convergent.
Vehicular Ad hoc Networks are a special form of wireless networks made for vehicles with bidirectional communicating devices. This attracts the concept of ubiquitous and pervasive computing for the future. VANET has received more researchers and has unlocked a path to develop few applications like traffic management, propagation of emergency messages and few user defined applications. VANETs have characteristics like dynamic network structure, node mobility, low processing speed and low memory which needs special attention. These properties facilitate more graph theory algorithms to be applicable in making shortest and best routes between the source and destination. This paper presents a survey on different routing techniques which are operated based on graph theory algorithms. The outcome of this paper may be considered in future to design an efficient routing protocol for VANET.
The Ordinary Least Squares Estimator (OLSE) is the best method for linear regression if the classical assumptions are satis ed for estimating weights. When these assumptions are violated, the robust methods give more reliable estimates while the OLSE is strongly a ected adversely. In order to assess the sensitivity of some estimators using more than ve criteria, a secondary dataset on Anthropometric measurements from Komfo Anokye Teaching Hospital, Kumasi-Ghana, is used. In this study, we compare the performance of the Huber Maximum Likelihood Estimator (HMLE), Least Trimmed Squares Estimator (LTSE), S Estimator (SE) and Modified Maximum Likelihood Estimator (MMLE) relative to the OLSE when the dataset has normal errors; 10, 20 and 30 percent outliers; 20% error contamination and lognormal contamination in the response variable. In the assessment, we use coefficients and their standard errors, relative efficiencies, Root Mean Square Errors, and the coefficients of determination of the estimators. We also use the power of the test to assess the e ects of the aberrations on the post hoc power analysis of the estimators. The results show the SE and MMLE outperform the HMLE and LTSE while the OLSE breaks down completely. The LTSE performs well when the trimming is done to eliminate only the outliers. Also, SE and MMLE resist the e ect of all aberrations in the data and also have good post hoc power analysis.