The transportation model is a well-recognized and applied algorithm in the distribution of products of logistics operations in enterprises. Multiple forms of solution are algorithmic and technological, which are applied to determine the optimal allocation of one type of product. In this research, the general formulation of the transport model by means of linear programming, where the optimal solution is integrated for different types of related products, and through a digital, dynamic, easy illustration Develops understanding of the Computer in Excel QM program. When choosing, the implementation of the form in the organization is provided.

     In this research, our aim is to study the optimal control problem (OCP) for triple nonlinear elliptic boundary value problem (TNLEBVP). The Mint-Browder theorem is used to prove the existence and uniqueness theorem of the solution of the state vector for fixed control vector. The existence theorem for the triple continuous classical optimal control vector (TCCOCV) related to the TNLEBVP is also proved. After studying the existence of a unique solution for the triple adjoint equations (TAEqs) related to the triple of the state equations, we derive The Fréchet derivative (FD) of the cost function using Hamiltonian function. Then the theorems of necessity conditions and the sufficient condition for optimality of

Due to its importance in physics and applied mathematics, the non-linear Sturm-Liouville problems
witnessed massive attention since 1960. A powerful Mathematical technique called the Newton-Kantorovich
method is applied in this work to one of the non-linear Sturm-Liouville problems. To the best of the authors’
knowledge, this technique of Newton-Kantorovich has never been applied before to solve the non-linear
Sturm-Liouville problems under consideration. Accordingly, the purpose of this work is to show that this
important specific kind of non-linear Sturm-Liouville differential equations problems can be solved by
applying the well-known Newton-Kantorovich method. Also, to show the efficiency of appl

The researchers have tried to focus on how to determine the number of pipes that are present in one obtained hyperbola in radargram profile. Ground Penetration Radar (GPR) survey was performed to distinguish between two zero-spaced iron pipes in radargram. The field work was carried out by constructing artificial rectangular models with dimensions of length, width, and depth equal to 10.0, 1.0, 0.65 meter respectively that filled with dry clastic mixture deposit, three twin sets of air filled iron pipes of 15.24 cm (6 inch) diameter were buried horizontally and vertically inside the mixture at different distances together. Visual and Numerical interpretation were chosen to get the best results. In the visual interpretation, the amplitude

The researchers have tried to focus on how to determine the number of pipes that are present in one obtained hyperbola in radargram profile. Ground Penetration Radar (GPR) survey was performed to distinguish between two zero-spaced iron pipes in radargram. The field work was carried out by constructing artificial rectangular models with dimensions of length, width, and depth equal to 10.0, 1.0, 0.65 meter respectively that filled with dry clastic mixture deposit, three twin sets of air filled iron pipes of 15.24 cm (6 inch) diameter were buried horizontally and vertically inside the mixture at different distances together. Visual and Numerical interpretation were chosen to get the best results. In the visual interpretation, the amplitude

objective : To assess for Psychological Problems. The study was carried out from 1st of December 2004 to 15th
March, 2005.
Mythology : A descriptive comparative study was conducted for elder in the geriatric home and the community;
A questionnaire was constructed to achieve the purposes of the study; it includes two parts dealing with the
elder demographic characteristics and psychological problems.
A purposive (no probability) sampling of (100) elderly include (50) elderly from the Geriatric Home and (50)
elderly from the community.
Data were collected and analyzed through a descriptive statistical approach (frequency, percentage, mean and
mean of scores, Standard deviation, Relative Sufficiency).
Result : the

This paper focuses on developing a self-starting numerical approach that can be used for direct integration of higher-order initial value problems of Ordinary Differential Equations. The method is derived from power series approximation with the resulting equations discretized at the selected grid and off-grid points. The method is applied in a block-by-block approach as a numerical integrator of higher-order initial value problems. The basic properties of the block method are investigated to authenticate its performance and then implemented with some tested experiments to validate the accuracy and convergence of the method.

Abstract

Prescribing drugs to patients to treat ailments or reducing their morbidity may not be enough, even if the drugs were all indicated and in the right dose. Clinical pharmacists play a pivotal role in conducting information and instruction to patients and conveying feedback to treating physician when appropriate, and the final goal is in the interest of the patient.  Identification and classification of drug related problems and discussing them with the health care providers.  Prospective, interventional, clinical study for 180 hemodialysis patients, and was designed as two phases, an observational phase to identify drug related problems and classifying them according to the latest Pharmaceutical

Scheduling problems have been treated as single criterion problems until recently. Many of these problems are computationally hard to solve three as single criterion problems. However, there is a need to consider multiple criteria in a real life scheduling problem in general. In this paper, we study the problem of scheduling jobs on a single machine to minimize total tardiness subject to maximum earliness or tardiness for each job. And we give algorithm (ETST) to solve the first problem (p1) and algorithm (TEST) to solve the second problem (p2) to find an efficient solution.