Open Access. Powered by Scholars. Published by Universities.®
Numerical Analysis and Computation Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Keyword
-
- Availability (1)
- Benchmark (1)
- Common set of weights (1)
- Concrete Mixture Plant (1)
- Confidence interval (1)
-
- Data envelopment analysis (1)
- Delay analysis (1)
- Discrete-time queueing theory (1)
- Generating functions (1)
- Ideal decision making unit (1)
- Interval estimated linear fractional programming model (IELFPM) (1)
- Interval valued function (IVF) (1)
- Linear fractional programming (LFP) (1)
- Operational matrix integration (1)
- Optimum solution (1)
- Preventive Maintenance and Supplementary Variable Technique (1)
- Priority scheduling (1)
- Ranking (1)
- Reliability (1)
- Two-dimensional Legendre wavelets (1)
- Variable-coefficient coupled Burgers’ equation (1)
Articles 1 - 5 of 5
Full-Text Articles in Numerical Analysis and Computation
Modern Approach For Designing And Solving Interval Estimated Linear Fractional Programming Models, S. Ananthalakshmi, C. Vijayalakshmi, V. Ganesan
Modern Approach For Designing And Solving Interval Estimated Linear Fractional Programming Models, S. Ananthalakshmi, C. Vijayalakshmi, V. Ganesan
Applications and Applied Mathematics: An International Journal (AAM)
Optimization methods have been widely applied in statistics. In mathematical programming, the coefficients of the models are always categorized as deterministic values. However uncertainty always exists in realistic problems. Therefore, interval-estimated optimization models may provide an alternative choice for considering the uncertainty into the optimization models. In this aspect, this paper concentrates, the lower and upper values of interval estimated linear fractional programming model (IELFPM) are obtained by using generalized confidence interval estimation method. An IELFPM is a LFP with interval form of the coefficients in the objective function and all requirements. The solution of the IELFPM is also analyzed.
A Ranking Method Based On Common Weights And Benchmark Point, Ali Payan, Abbas A. Noora, Farhad H. Lotfi
A Ranking Method Based On Common Weights And Benchmark Point, Ali Payan, Abbas A. Noora, Farhad H. Lotfi
Applications and Applied Mathematics: An International Journal (AAM)
The highest efficiency score 1 (100% efficiency) is regarded as a common benchmark for Decision Making Units (DMUs). This brings about the existence of more than one DMU with the highest score. Such a case normally occurs in all Data Envelopment Analysis (DEA) models and also in all the Common Set of Weights (CSWs) methods and it may lead to the lack of thorough ranking of DMUs. And ideal DMU based on its specific structure is a unit that no unit would do better than. Therefore, it can be utilized as a benchmark for other units. We are going to …
Numerical Solution For The Systems Of Variable-Coefficient Coupled Burgers’ Equation By Two-Dimensional Legendre Wavelets Method, Hossein Aminikhah, Sakineh Moradian
Numerical Solution For The Systems Of Variable-Coefficient Coupled Burgers’ Equation By Two-Dimensional Legendre Wavelets Method, Hossein Aminikhah, Sakineh Moradian
Applications and Applied Mathematics: An International Journal (AAM)
In this paper, a numerical method for solving the systems of variable-coefficient coupled Burgers’ equation is proposed. The method is based on two-dimensional Legendre wavelets. Two-dimensional operational matrices of integration are introduced and then employed to find a solution to the systems of variable-coefficient coupled Burgers’ equation. Two examples are presented to illustrate the capability of the method. It is shown that the numerical results are in good agreement with the exact solutions for each problem.
Delay Analysis Of A Discrete-Time Non-Preemptive Priority Queue With Priority Jumps, Deepak C. Pandey, Arun K. Pal
Delay Analysis Of A Discrete-Time Non-Preemptive Priority Queue With Priority Jumps, Deepak C. Pandey, Arun K. Pal
Applications and Applied Mathematics: An International Journal (AAM)
In this paper, we consider a discrete-time non-preemptive priority queueing model with priority jumps. Two classes, real-time (high priority) and non-real time (low priority), of traffic will be considered with providing jumps from lower priority traffic to the queue of high priority traffic. We derive expressions for the joint probability generating function of the system contents of the high and the low priority traffic in the steady state and also for some performance measures such as the mean value of the system contents and the packet delay. The behavior of the priority queues with priority jumps will be illustrated by …
Stochastic Modeling Of A Concrete Mixture Plant With Preventive Maintenance, Ashish Kumar, Monika Saini, S. C. Malik
Stochastic Modeling Of A Concrete Mixture Plant With Preventive Maintenance, Ashish Kumar, Monika Saini, S. C. Malik
Applications and Applied Mathematics: An International Journal (AAM)
In this paper, a stochastic model for concrete mixture plant with Preventive Maintenance (PM) is analyzed in detail by using a supplementary variable technique. In a concrete mixture plant eight subsystems are arranged in a series. The system goes under PM after a maximum operation time and work as new after PM. The time to failure of each subsystem follows a negative exponential distribution while PM and repair time distributions are taken as arbitrary. A sufficient repair facility is provided to the system for conducting PM and repair of the system. Repair, maintenance and switch devices are perfect. All random …