International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
In this study, we discussed a fuzzy programming approach to bi-level linear programming problems and their application. Bi-level linear programming is characterized as mathematical programming to solve decentralized problems with two decision-makers in the hierarchal organization. They become more important for the contemporary decentralized organization where each unit seeks to optimize its own objective. In addition to this, we have considered Bi-Level Linear Programming (BLPP) and applied the Fuzzy Mathematical Programming (FMP) approach to get the solution of the system. We have suggested the FMP method for the minimization of the objectives in terms of the linear membership functions. FMP is a supervised search procedure (supervised by the upper Decision Maker (DM)). The upper-level decision-maker provides the preferred values of decision variables under his control (to enable the lower level DM to search for his optimum in a wider feasible space) and the bounds of his objective function (to direct the lower level DM to search for his solutions in the right direction).
MINIMIZING THE COMPLEXITY EFFECTS TO MAS ARCHITECTURES DESIGN BASED ON FG4COM...ijseajournal
The efficiency of multi agent system design mainly depends on the quality of a theoretical
architecture of such systems. Therefore, quality issues should be considered at an early stage in
the software development. Large systems such as multi agents systems (MAS) require many
communications and interactions to accomplish their tasks, and this leads to complexity of
architecture design (AD) which have crucial influence on architecture design quality. This work
attempts to introduce approach works on increase the architecture design quality of MAS by
minimizing the effect of complexity
Models of Operations Research is addressedSundar B N
Introduction, Meaning and Characteristics of Operations Research is addressed.
MODELS IN OPERATIONS RESEARCH, Classification of Models, degree of abstraction, Purpose Models, Predictive models, Descriptive models, Prescriptive models, Mathematic / Symbolic models, Models by nature of an environment, Models by the extent of generality, Models by Behaviour, Models by Method of Solution, Models by Method of Solution, Static and dynamic models, Iconic models Iconic models, Analogue models.
Subscribe to Vision Academy for Video Assistance
https://www.youtube.com/channel/UCjzpit_cXjdnzER_165mIiw
A new analysis of failure modes and effects by fuzzy todim with using fuzzy t...ijfls
Failure mode and effects analysis (FMEA) is awidely used engineering technique for designing, identifying
and eliminating theknown and/or potential failures, problems, and errors and so on from system to other
parts. The evaluating of FMEA parameters is challenging point because it’s importantfor managers to
know the real risk in their systems. In this study,we used fuzzy TODIM for evaluating the potential failure
modes in our system respect to factors of FMEA,which is known as; Severity(S); Occurrence (O); and
detect ability (D).The final result was combined with fuzzy time function which helps to predict systems in
future and solving problems in our system and it could help to avoid potential future failure modes in our
systems.
This document provides an overview of various operations research (OR) models, including: linear programming, network flow programming, integer programming, nonlinear programming, dynamic programming, stochastic programming, combinatorial optimization, stochastic processes, discrete time Markov chains, continuous time Markov chains, queuing, and simulation. It describes the basic components and applications of each model type at a high level.
An optimal general type-2 fuzzy controller for Urban Traffic NetworkISA Interchange
This document presents an optimal general type-2 fuzzy controller (OGT2FC) for controlling traffic signal scheduling and phase succession to minimize wait times and average queue length. The OGT2FC uses a combination of general type-2 fuzzy logic sets and the Modified Backtracking Search Algorithm (MBSA) to optimize the membership function parameters. Simulation results show the OGT2FC performs better than conventional type-1 fuzzy controllers in regulating urban traffic flow.
Dynamic programming is a technique used to solve complex problems by breaking them down into smaller, simpler modules. It involves comparing and combining solutions from previous analyses to determine the optimal solution. While similar to greedy algorithms, dynamic programming is better as it does not rely on local optima. Dynamic programming finds applications in fields like bioinformatics for problems involving sequence alignment, protein folding, and RNA structure prediction.
This document discusses software design principles and methodologies. It defines software design as transforming system requirements into a form that can be implemented in a programming language. The outcomes of the design process are identified as modules, control relationships between modules, module interfaces, and data structures and algorithms for each module. The document also discusses functional independence, cohesion, coupling, and different design approaches like function-oriented and object-oriented design.
In this study, we discussed a fuzzy programming approach to bi-level linear programming problems and their application. Bi-level linear programming is characterized as mathematical programming to solve decentralized problems with two decision-makers in the hierarchal organization. They become more important for the contemporary decentralized organization where each unit seeks to optimize its own objective. In addition to this, we have considered Bi-Level Linear Programming (BLPP) and applied the Fuzzy Mathematical Programming (FMP) approach to get the solution of the system. We have suggested the FMP method for the minimization of the objectives in terms of the linear membership functions. FMP is a supervised search procedure (supervised by the upper Decision Maker (DM)). The upper-level decision-maker provides the preferred values of decision variables under his control (to enable the lower level DM to search for his optimum in a wider feasible space) and the bounds of his objective function (to direct the lower level DM to search for his solutions in the right direction).
MINIMIZING THE COMPLEXITY EFFECTS TO MAS ARCHITECTURES DESIGN BASED ON FG4COM...ijseajournal
The efficiency of multi agent system design mainly depends on the quality of a theoretical
architecture of such systems. Therefore, quality issues should be considered at an early stage in
the software development. Large systems such as multi agents systems (MAS) require many
communications and interactions to accomplish their tasks, and this leads to complexity of
architecture design (AD) which have crucial influence on architecture design quality. This work
attempts to introduce approach works on increase the architecture design quality of MAS by
minimizing the effect of complexity
Models of Operations Research is addressedSundar B N
Introduction, Meaning and Characteristics of Operations Research is addressed.
MODELS IN OPERATIONS RESEARCH, Classification of Models, degree of abstraction, Purpose Models, Predictive models, Descriptive models, Prescriptive models, Mathematic / Symbolic models, Models by nature of an environment, Models by the extent of generality, Models by Behaviour, Models by Method of Solution, Models by Method of Solution, Static and dynamic models, Iconic models Iconic models, Analogue models.
Subscribe to Vision Academy for Video Assistance
https://www.youtube.com/channel/UCjzpit_cXjdnzER_165mIiw
A new analysis of failure modes and effects by fuzzy todim with using fuzzy t...ijfls
Failure mode and effects analysis (FMEA) is awidely used engineering technique for designing, identifying
and eliminating theknown and/or potential failures, problems, and errors and so on from system to other
parts. The evaluating of FMEA parameters is challenging point because it’s importantfor managers to
know the real risk in their systems. In this study,we used fuzzy TODIM for evaluating the potential failure
modes in our system respect to factors of FMEA,which is known as; Severity(S); Occurrence (O); and
detect ability (D).The final result was combined with fuzzy time function which helps to predict systems in
future and solving problems in our system and it could help to avoid potential future failure modes in our
systems.
This document provides an overview of various operations research (OR) models, including: linear programming, network flow programming, integer programming, nonlinear programming, dynamic programming, stochastic programming, combinatorial optimization, stochastic processes, discrete time Markov chains, continuous time Markov chains, queuing, and simulation. It describes the basic components and applications of each model type at a high level.
An optimal general type-2 fuzzy controller for Urban Traffic NetworkISA Interchange
This document presents an optimal general type-2 fuzzy controller (OGT2FC) for controlling traffic signal scheduling and phase succession to minimize wait times and average queue length. The OGT2FC uses a combination of general type-2 fuzzy logic sets and the Modified Backtracking Search Algorithm (MBSA) to optimize the membership function parameters. Simulation results show the OGT2FC performs better than conventional type-1 fuzzy controllers in regulating urban traffic flow.
Dynamic programming is a technique used to solve complex problems by breaking them down into smaller, simpler modules. It involves comparing and combining solutions from previous analyses to determine the optimal solution. While similar to greedy algorithms, dynamic programming is better as it does not rely on local optima. Dynamic programming finds applications in fields like bioinformatics for problems involving sequence alignment, protein folding, and RNA structure prediction.
This document discusses software design principles and methodologies. It defines software design as transforming system requirements into a form that can be implemented in a programming language. The outcomes of the design process are identified as modules, control relationships between modules, module interfaces, and data structures and algorithms for each module. The document also discusses functional independence, cohesion, coupling, and different design approaches like function-oriented and object-oriented design.
This presentation is trying to explain the Linear Programming in operations research. There is a software called "Gipels" available on the internet which easily solves the LPP Problems along with the transportation problems. This presentation is co-developed with Sankeerth P & Aakansha Bajpai.
By:-
Aniruddh Tiwari
Linkedin :- http://in.linkedin.com/in/aniruddhtiwari
This document summarizes a study on the impact of classes playing roles in design patterns. The study analyzed classes playing zero, one, or two roles across six Java programs. It found that on average 8.24% of classes played one role and 17.81% played two roles. Classes playing roles, especially two roles, had significantly higher values for internal metrics like coupling and cohesion. Classes playing two roles also changed significantly more than other classes. The results confirm previous findings and justify further study into ranking design pattern occurrences based on class roles and metrics.
This document provides an overview of transaction level modeling. It defines four transaction level models (TLMs) - specification model, component-assembly model, bus-arbitration model, and bus-functional model. These models are used at different stages of the design flow, from modeling system functionality without implementation details, to modeling with approximate timing, to cycle-accurate modeling. The models balance abstraction level and implementation details to aid system-level design while still allowing validation and refinement.
This document discusses concepts related to decision making including axioms, normative analysis, decision problems, objectives, attributes, and decision making methods. It provides descriptions of the SMART method and key stages in SMART analysis including identifying decision makers and alternatives, attributes, assigning values, determining weights, and sensitivity analysis. Criteria for accurate value trees and conditions for decision making under certainty, uncertainty, and risk are also outlined.
An efficient method of solving lexicographic linear goal programming problemAlexander Decker
This document summarizes a new algorithm for solving lexicographic linear goal programming problems. It begins by introducing lexicographic (preemptive) linear goal programming and its general algebraic representation. It then describes the new algorithm, which utilizes an initial table and considers goal constraints as both the objective function and constraints. The algorithm sequentially solves the prioritized deviational variables from the highest to lowest priority level. It initially excludes deviational variable columns not in the basis table but develops them when necessary. The algorithm proceeds through feasibility and optimality testing before selecting an entering variable to maintain the priority structure, ultimately reaching an optimal solution.
This document discusses using Constrained Local Models (CLM) for facial landmark localization and applications in pose estimation and facial expression classification. It describes:
1) How CLM models are trained using local image descriptors for each landmark region rather than a holistic texture model, and how the Subspace Constrained Mean Shift algorithm is used to fit the CLM to new images.
2) How the trained CLM can be applied to estimate head pose by inferring orientation from localized facial landmarks.
3) How facial expressions are classified based on detected Action Units (facial muscle movements) from CLM-localized landmarks.
Evaluation results are presented for the CLM landmark localization, pose estimation, and expression
This document discusses various cognitive models used in human-computer interaction design. It describes goal and task hierarchies which model user goals as a hierarchy of subgoals. It also covers linguistic models like Backus-Naur Form (BNF) and Task-Action Grammar (TAG) which model dialogs between users and systems. Other models discussed include GOMS, Cognitive Complexity Theory (CCT), the Keystroke Level Model (KLM), and Buxton's three-state model for modeling physical interactions. The models aim to represent aspects of user understanding, knowledge, intentions, and processing to inform the design of interactive systems.
Linear programming is a mathematical modeling technique used to allocate limited resources to maximize an objective. It involves defining decision variables, constraints, and an objective function in a linear relationship. Some key applications of linear programming include production planning, portfolio selection, and transportation problems. The simplex method is commonly used to solve linear programming problems and find an optimal feasible solution. Duality relates a primal linear program to its dual program. Sensitivity analysis examines how changes to parameters like costs or capacities impact the optimal solution.
2 a review of different approaches to the facility layout problemsQuốc Lê
This document provides a review of different approaches that have been used to solve facility layout problems (FLPs). It begins with an overview of FLPs and common formulations, including the quadratic assignment problem (QAP) and mixed integer programming (MIP) models. It then discusses various solution methodologies that have been applied, including exact procedures like branch and bound, heuristics like pairwise interchange, and metaheuristics like simulated annealing and genetic algorithms. The document observes trends in multi-objective approaches and software development using metaheuristics. It concludes by noting FLP remains an active area of research.
A review of automatic differentiationand its efficient implementationssuserfa7e73
Automatic differentiation is a powerful tool for automatically calculating derivatives of mathematical functions and algorithms. It works by expressing the target function as a sequence of elementary operations and then applying the chain rule to differentiate each operation. This can be done using either forward or reverse mode. Forward mode calculates how changes in inputs propagate through the function to influence the outputs, while reverse mode calculates how changes in outputs backpropagate to influence the inputs. Both modes require performing the computation twice - once for the forward pass and once for the derivative pass. Careful implementation is required to make automatic differentiation efficient in terms of speed and memory usage.
This document presents new certified optimal solutions found by the Charibde algorithm for six difficult benchmark optimization problems. Charibde combines an evolutionary algorithm and interval-based methods in a cooperative framework. It has achieved optimality proofs for five bound-constrained problems and one nonlinearly constrained problem. These problems are highly multimodal and some had not been solved before even with approximate methods. The document also compares Charibde's performance to other state-of-the-art solvers, showing it is highly competitive while providing reliable optimality proofs.
This document summarizes research on using graph partitioning techniques to solve digital circuit layout problems. It discusses how the digital circuit layout problem is a constrained optimization problem that is NP-hard. It then reviews previous work on using techniques like min-cut bipartitioning, multi-way partitioning algorithms, and spectral graph partitioning to solve the problem. The document concludes by analyzing evolutionary approaches that have been used, including genetic algorithms, memetic algorithms, ant colony optimization, and particle swarm intelligence. It finds that these approaches are dependent on representation and initialization but can produce quality solutions for small circuits.
This document discusses several socio-organizational issues and stakeholder requirements that must be considered when designing new computer systems. It describes organizational issues like power relationships, who benefits from systems, and ensuring all stakeholders can use systems. It also discusses capturing requirements through stakeholder analysis, socio-technical models, soft systems methodology, participatory design, and ethnographic methods. These aim to understand work contexts and stakeholder perspectives to develop systems that can be successfully adopted.
This document defines key concepts in multi-criteria decision making (MCDM) including criteria, alternatives, and decisions. It provides examples of single-criterion and multiple-criteria decision problems. For multiple-criteria problems, alternatives differ in more than one criterion and criteria are often competing. Formal MCDM analysis is useful when criteria are competing and trade-offs are difficult to evaluate. The document discusses types of MCDM problems and contexts for MCDM including mutually exclusive alternatives, portfolio selection, design, and measurement.
Abstract
It is well known that design loads vary randomly during equipment operations. Similarly, material properties such as yield strength, tensile strength, fatigue strength, etc. are random variables. Design analytical models are approximations of reality and failure mode models are also approximations. Consequently, design solutions are not exact. Practical design must therefore, consider the random nature and statistical variability of design parameters. Reliability-based design models are developed to provide practical design methods. This paper develops a lognormal reliability-based design model that can be coded in Excel Spreedsheet. Two design examples are considered in demonstrating the application of the formulated model. In the first example, our result differs from the result from [7] by 0.9% on the conservative side. The weight of the beam in the second example differs from [9] by 14.53% positively for a reliability target of z = 3. This variance is largely due to differences in reliability targets. When the beam size is adjusted to closely match the reliability levels of [9], the weight of the beam becomes 1.4% lower for our model. Therefore the results from our reliability model give comparable but slightly conservative and realistic solutions.
Keywords: Lognormal, Reliability, Variability, Normal Variate
Analysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Net...IDES Editor
The document analyzes and proposes enhancements to four leader election algorithms used in mobile ad hoc networks (MANETs). It considers factors like time complexity, message complexity, assumptions, fault tolerance, and timing models. Key points:
- It summarizes four leader election algorithms for MANETs and analyzes them based on common factors.
- Proposed enhancements include nodes inquiring about the current leader instead of starting new elections, using candidates to reduce overhead, and considering battery life and signal strength in elections.
- The analysis and enhancements aim to help system designers choose the right election algorithm for MANETs by providing a reference on time/message complexities and how the algorithms handle aspects like as
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document presents a comparative study of the physico-chemical properties of effluents from small and large-scale pulp and paper mills in India. Samples were collected from different processing units and seasons from one small-scale agro-based mill (Mill A) and one large-scale wood-based mill (Mill B). The samples were analyzed for parameters like pH, color, BOD, COD, TDS, etc. The results showed that the effluents varied significantly between the different units and mills. Overall, Mill A was found to have more polluted effluents compared to Mill B, likely due to differences in raw materials and processing. The effluents generally did not meet regulatory standards for discharge
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This presentation is trying to explain the Linear Programming in operations research. There is a software called "Gipels" available on the internet which easily solves the LPP Problems along with the transportation problems. This presentation is co-developed with Sankeerth P & Aakansha Bajpai.
By:-
Aniruddh Tiwari
Linkedin :- http://in.linkedin.com/in/aniruddhtiwari
This document summarizes a study on the impact of classes playing roles in design patterns. The study analyzed classes playing zero, one, or two roles across six Java programs. It found that on average 8.24% of classes played one role and 17.81% played two roles. Classes playing roles, especially two roles, had significantly higher values for internal metrics like coupling and cohesion. Classes playing two roles also changed significantly more than other classes. The results confirm previous findings and justify further study into ranking design pattern occurrences based on class roles and metrics.
This document provides an overview of transaction level modeling. It defines four transaction level models (TLMs) - specification model, component-assembly model, bus-arbitration model, and bus-functional model. These models are used at different stages of the design flow, from modeling system functionality without implementation details, to modeling with approximate timing, to cycle-accurate modeling. The models balance abstraction level and implementation details to aid system-level design while still allowing validation and refinement.
This document discusses concepts related to decision making including axioms, normative analysis, decision problems, objectives, attributes, and decision making methods. It provides descriptions of the SMART method and key stages in SMART analysis including identifying decision makers and alternatives, attributes, assigning values, determining weights, and sensitivity analysis. Criteria for accurate value trees and conditions for decision making under certainty, uncertainty, and risk are also outlined.
An efficient method of solving lexicographic linear goal programming problemAlexander Decker
This document summarizes a new algorithm for solving lexicographic linear goal programming problems. It begins by introducing lexicographic (preemptive) linear goal programming and its general algebraic representation. It then describes the new algorithm, which utilizes an initial table and considers goal constraints as both the objective function and constraints. The algorithm sequentially solves the prioritized deviational variables from the highest to lowest priority level. It initially excludes deviational variable columns not in the basis table but develops them when necessary. The algorithm proceeds through feasibility and optimality testing before selecting an entering variable to maintain the priority structure, ultimately reaching an optimal solution.
This document discusses using Constrained Local Models (CLM) for facial landmark localization and applications in pose estimation and facial expression classification. It describes:
1) How CLM models are trained using local image descriptors for each landmark region rather than a holistic texture model, and how the Subspace Constrained Mean Shift algorithm is used to fit the CLM to new images.
2) How the trained CLM can be applied to estimate head pose by inferring orientation from localized facial landmarks.
3) How facial expressions are classified based on detected Action Units (facial muscle movements) from CLM-localized landmarks.
Evaluation results are presented for the CLM landmark localization, pose estimation, and expression
This document discusses various cognitive models used in human-computer interaction design. It describes goal and task hierarchies which model user goals as a hierarchy of subgoals. It also covers linguistic models like Backus-Naur Form (BNF) and Task-Action Grammar (TAG) which model dialogs between users and systems. Other models discussed include GOMS, Cognitive Complexity Theory (CCT), the Keystroke Level Model (KLM), and Buxton's three-state model for modeling physical interactions. The models aim to represent aspects of user understanding, knowledge, intentions, and processing to inform the design of interactive systems.
Linear programming is a mathematical modeling technique used to allocate limited resources to maximize an objective. It involves defining decision variables, constraints, and an objective function in a linear relationship. Some key applications of linear programming include production planning, portfolio selection, and transportation problems. The simplex method is commonly used to solve linear programming problems and find an optimal feasible solution. Duality relates a primal linear program to its dual program. Sensitivity analysis examines how changes to parameters like costs or capacities impact the optimal solution.
2 a review of different approaches to the facility layout problemsQuốc Lê
This document provides a review of different approaches that have been used to solve facility layout problems (FLPs). It begins with an overview of FLPs and common formulations, including the quadratic assignment problem (QAP) and mixed integer programming (MIP) models. It then discusses various solution methodologies that have been applied, including exact procedures like branch and bound, heuristics like pairwise interchange, and metaheuristics like simulated annealing and genetic algorithms. The document observes trends in multi-objective approaches and software development using metaheuristics. It concludes by noting FLP remains an active area of research.
A review of automatic differentiationand its efficient implementationssuserfa7e73
Automatic differentiation is a powerful tool for automatically calculating derivatives of mathematical functions and algorithms. It works by expressing the target function as a sequence of elementary operations and then applying the chain rule to differentiate each operation. This can be done using either forward or reverse mode. Forward mode calculates how changes in inputs propagate through the function to influence the outputs, while reverse mode calculates how changes in outputs backpropagate to influence the inputs. Both modes require performing the computation twice - once for the forward pass and once for the derivative pass. Careful implementation is required to make automatic differentiation efficient in terms of speed and memory usage.
This document presents new certified optimal solutions found by the Charibde algorithm for six difficult benchmark optimization problems. Charibde combines an evolutionary algorithm and interval-based methods in a cooperative framework. It has achieved optimality proofs for five bound-constrained problems and one nonlinearly constrained problem. These problems are highly multimodal and some had not been solved before even with approximate methods. The document also compares Charibde's performance to other state-of-the-art solvers, showing it is highly competitive while providing reliable optimality proofs.
This document summarizes research on using graph partitioning techniques to solve digital circuit layout problems. It discusses how the digital circuit layout problem is a constrained optimization problem that is NP-hard. It then reviews previous work on using techniques like min-cut bipartitioning, multi-way partitioning algorithms, and spectral graph partitioning to solve the problem. The document concludes by analyzing evolutionary approaches that have been used, including genetic algorithms, memetic algorithms, ant colony optimization, and particle swarm intelligence. It finds that these approaches are dependent on representation and initialization but can produce quality solutions for small circuits.
This document discusses several socio-organizational issues and stakeholder requirements that must be considered when designing new computer systems. It describes organizational issues like power relationships, who benefits from systems, and ensuring all stakeholders can use systems. It also discusses capturing requirements through stakeholder analysis, socio-technical models, soft systems methodology, participatory design, and ethnographic methods. These aim to understand work contexts and stakeholder perspectives to develop systems that can be successfully adopted.
This document defines key concepts in multi-criteria decision making (MCDM) including criteria, alternatives, and decisions. It provides examples of single-criterion and multiple-criteria decision problems. For multiple-criteria problems, alternatives differ in more than one criterion and criteria are often competing. Formal MCDM analysis is useful when criteria are competing and trade-offs are difficult to evaluate. The document discusses types of MCDM problems and contexts for MCDM including mutually exclusive alternatives, portfolio selection, design, and measurement.
Abstract
It is well known that design loads vary randomly during equipment operations. Similarly, material properties such as yield strength, tensile strength, fatigue strength, etc. are random variables. Design analytical models are approximations of reality and failure mode models are also approximations. Consequently, design solutions are not exact. Practical design must therefore, consider the random nature and statistical variability of design parameters. Reliability-based design models are developed to provide practical design methods. This paper develops a lognormal reliability-based design model that can be coded in Excel Spreedsheet. Two design examples are considered in demonstrating the application of the formulated model. In the first example, our result differs from the result from [7] by 0.9% on the conservative side. The weight of the beam in the second example differs from [9] by 14.53% positively for a reliability target of z = 3. This variance is largely due to differences in reliability targets. When the beam size is adjusted to closely match the reliability levels of [9], the weight of the beam becomes 1.4% lower for our model. Therefore the results from our reliability model give comparable but slightly conservative and realistic solutions.
Keywords: Lognormal, Reliability, Variability, Normal Variate
Analysis and Enhancements of Leader Elections algorithms in Mobile Ad Hoc Net...IDES Editor
The document analyzes and proposes enhancements to four leader election algorithms used in mobile ad hoc networks (MANETs). It considers factors like time complexity, message complexity, assumptions, fault tolerance, and timing models. Key points:
- It summarizes four leader election algorithms for MANETs and analyzes them based on common factors.
- Proposed enhancements include nodes inquiring about the current leader instead of starting new elections, using candidates to reduce overhead, and considering battery life and signal strength in elections.
- The analysis and enhancements aim to help system designers choose the right election algorithm for MANETs by providing a reference on time/message complexities and how the algorithms handle aspects like as
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document presents a comparative study of the physico-chemical properties of effluents from small and large-scale pulp and paper mills in India. Samples were collected from different processing units and seasons from one small-scale agro-based mill (Mill A) and one large-scale wood-based mill (Mill B). The samples were analyzed for parameters like pH, color, BOD, COD, TDS, etc. The results showed that the effluents varied significantly between the different units and mills. Overall, Mill A was found to have more polluted effluents compared to Mill B, likely due to differences in raw materials and processing. The effluents generally did not meet regulatory standards for discharge
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
This document describes the design and implementation of a low-cost arbitrary waveform generator for educational purposes using an ARM7 microcontroller. It uses direct digital synthesis (DDS) to generate waveforms with adjustable frequency and phase. The generator can produce sine, square, triangular and sawtooth waves from 0-10 kHz with good frequency and amplitude stability. It provides a low-cost option for undergraduate labs compared to commercial generators. The ARM7 implementation allows it to also serve as a student design project.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
From June to September 2013, Jim Anderson and Alice Ferris of GoalBusters Consulting embarked on a mission to thank someone every day for 100 days. The 100 Days of Gratitude was supposed to be a way to get us to blog more, but instead, it was an inspiring, emotional, touching, frustrating, occasionally dramatic, and, in the end, transforming experience.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Een van de gemeenschappelijke vragen als het gaat om het plannen van een reis naar het buitenland is: "Wat moet ik meenemen?" Het juiste antwoord hangt af van alle risicofactoren, zoals de locatie, de tijdsduur, het land , enz. Bijvoorbeeld, als een persoon van plan is om de Mount Everest te beklimmen of te gaan zeilen over de hele wereld heb je andere zaken nodig dan dat je voor een week naar Bangkok gaat. Echter, onder de verschillende omstandigheden is een verbandset voor op reis zeker nodig.
Este documento describe dos herramientas digitales para compartir presentaciones y fotos: Slideshare y Flickr. Slideshare permite subir y compartir presentaciones de PowerPoint u otros formatos, y es útil para que estudiantes compartan investigaciones. Flickr es un sitio para almacenar y compartir fotos y videos que puede usarse para subir imágenes de alta calidad y compartirlas en otras redes sociales. Ambas herramientas requieren crear una cuenta de usuario para publicar y descargar archivos.
This document provides instructions for securing a router using MAC filtering and managing a nano station wirelessly.
1) To set up MAC filtering, find all connected devices' MAC addresses in the DHCP client list, copy them, add them to the wireless MAC filtering list along with descriptions, and enable MAC filtering.
2) To manage a nano station wirelessly, set a static IP address of 192.168.1.2X in the router's WAN settings with a subnet mask of 255.255.255.0. This will allow wireless management of the nano station.
3) New devices can be added by disabling then re-enabling MAC filtering and repeating the addition steps.
Christopher Fremen is an accomplished retail professional with over 20 years of experience in visual merchandising and store operations management. He has held leadership roles at several major retailers, including Saks Fifth Avenue Off 5th, Bloomingdale's, Pier 1 Imports, and Disneyland Resort. Fremen has a proven track record of translating corporate strategies into actionable plans, managing teams, and ensuring stores meet visual merchandising standards. He is skilled in areas such as merchandising, project management, budgeting, and leadership training.
Interactive Fuzzy Goal Programming approach for Tri-Level Linear Programming ...IJERA Editor
The aim of this paper is to present an interactive fuzzy goal programming approach to determine the preferred
compromise solution to Tri-level linear programming problems considering the imprecise nature of the decision
makers’ judgments for the objectives. Using the concept of goal programming, fuzzy set theory, in combination
with interactive programming, and improving the membership functions by means of changing the tolerances of
the objectives provide a satisfactory compromise (near to ideal) solution to the upper level decision makers.
Two numerical examples for three-level linear programming problems have been solved to demonstrate the
feasibility of the proposed approach. The performance of the proposed approach was evaluated by using of
metric distance functions with other approaches.
Linear programming is a mathematical modeling technique useful for allocating scarce or limited resources to competing activities based on an optimality criterion. There are four key components of any linear programming model: decision variables, objective function, constraints, and non-negativity assumptions. Linear programming models make simplifying assumptions like certainty of parameters, additivity, linearity/proportionality, and divisibility of decision variables. The technique helps decision-makers use resources effectively and arrive at optimal solutions subject to constraints, but it has limitations if variables are not continuous or parameters uncertain.
For some management programming problems, multiple objectives to be optimized rather than a single
objective, and objectives can be expressed with ratio equations such as return/investment, operating
profit/net-sales, profit/manufacturing cost, etc. In this paper, we proposed the transformation
characteristics to solve the multi objective linear fractional programming (MOLFP) problems. If a MOLFP
problem with both the numerators and the denominators of the objectives are linear functions and some
technical linear restrictions are satisfied, then it is defined as a multi objective linear fractional
programming problem MOLFPP in this research. The transformation characteristics are illustrated and the
solution procedure and numerical example are presented.
Nonlinear Programming: Theories and Algorithms of Some Unconstrained Optimiza...Dr. Amarjeet Singh
Nonlinear programming problem (NPP) had become an important branch of operations research, and it was the mathematical programming with the objective function or constraints being nonlinear functions. There were a variety of traditional methods to solve nonlinear programming problems such as bisection method, gradient projection method, the penalty function method, feasible direction method, the multiplier method. But these methods had their specific scope and limitations, the objective function and constraint conditions generally had continuous and differentiable request. The traditional optimization methods were difficult to adopt as the optimized object being more complicated. However, in this paper, mathematical programming techniques that are commonly used to extremize nonlinear functions of single and multiple (n) design variables subject to no constraints are been used to overcome the above challenge. Although most structural optimization problems involve constraints that bound the design space, study of the methods of unconstrained optimization is important for several reasons. Steepest Descent and Newton’s methods are employed in this paper to solve an optimization problem.
Algorithmic Foundations For Business StrategyClaire Webber
This document introduces algorithmic and computational models for studying strategic problem solving and how firms adapt to complex environments. It discusses how strategic problems can be modeled as computational problems, such as optimizing NK fitness landscapes. Viewing strategic challenges through an algorithmic lens allows distinguishing between different levels of sophistication in how managers and organizations solve problems. It suggests some firms may gain advantage from capabilities like "offline problem solving" and "simulation advantage" that help effectively search solution spaces for complex issues.
Application of linear programming technique for staff training of register se...Enamul Islam
This study aims to minimize training costs for staff at Patuakhali Science and Technology University using linear programming. It identifies two decision variables (permanent and non-permanent staff to be trained) and develops constraints based on time available and staff in different departments. The linear programming model is solved to find the optimal solution: 1 permanent staff should be sent for 5 days of training among departments to minimize costs. The research suggests this approach can help determine optimal staffing levels for future training programs.
An efficient method of solving lexicographic linear goal programming problemAlexander Decker
This document presents a new algorithm for solving lexicographic linear goal programming problems. It begins with an introduction to lexicographic (preemptive) linear goal programming models, which prioritize deviational variables in the objective function. The new algorithm is then described, which utilizes an initial tableau and modifies it through iterations. Key steps include: 1) checking for feasibility, 2) performing an optimality test, 3) selecting an entering variable, 4) choosing a leaving variable, 5) updating the tableau. An illustrative example is provided and solved using the new algorithm to demonstrate the solution procedure. The algorithm aims to efficiently reach an optimal solution to lexicographic linear goal programming problems.
An Integrated Solver For Optimization ProblemsMonica Waters
This document presents an integrated solver called SIMPL that combines mixed integer linear programming, global optimization, and constraint programming techniques. SIMPL uses an algorithmic framework called search-infer-and-relax that encompasses various optimization methods. It also uses constraint-based modeling where constraints define how techniques are combined to solve the problem. The paper demonstrates that SIMPL can match or exceed the computational advantages of customized integrated solvers by solving production planning, product configuration, and machine scheduling problems.
UNIT-2 Quantitaitive Anlaysis for Mgt Decisions.pptxMinilikDerseh1
This document provides an overview of linear programming problems (LPP). It discusses the key components of linear programming models including objectives, decision variables, constraints, and parameters. It also covers formulation of LPP, graphical and simplex solution methods, duality, and post-optimality analysis. Various applications of linear programming in areas like production, marketing, finance, and personnel management are also highlighted. An example problem on determining optimal product mix given resource constraints is presented to illustrate linear programming formulation.
An exhaustive survey of reinforcement learning with hierarchical structureeSAT Journals
This document summarizes research on reinforcement learning with hierarchical structures. It discusses how hierarchical reinforcement learning (HRL) breaks down reinforcement learning problems into sub-problems. The document reviews HRL applications in domains like rescue robots, computer games, course scheduling, motion planning, and web service composition. It also proposes combining option and MAXQ algorithms for multi-robot target searching. In general, the document finds that HRL can help reduce computational complexity and speed up learning by breaking problems into hierarchical sub-problems.
Mc0079 computer based optimization methods--phpapp02Rabby Bhatt
This document discusses mathematical models and provides examples of different types of mathematical models. It begins by defining a mathematical model as a description of a system using mathematical concepts and language. It then classifies mathematical models in several ways, such as linear vs nonlinear, deterministic vs probabilistic, static vs dynamic, discrete vs continuous, and deductive vs inductive vs floating. The document provides examples and explanations of each type of model. It also discusses using finite queuing tables to analyze queuing systems with a finite population size. In summary, the document outlines different ways to classify mathematical models and provides examples of applying various types of models.
This document discusses model transformations using a Disaster Management Metamodel (DMM) to generate disaster management solution models. Key points:
- DMM was developed by analyzing 30 disaster management models to generalize concepts and relationships. It consists of four classes of concepts for mitigation, preparedness, response, and recovery phases.
- Model transformations can occur vertically between abstraction levels and horizontally within the same level. Instantiation is used to create a model instance from a metamodel. The document demonstrates instantiating a preparedness model from DMM.
- A prototype decision support system called DMDSS is presented which allows users to input disaster problems and instantiate customized solution models by combining relevant concepts from DMM guided by
Operations research (OR) is an interdisciplinary approach for decision-making that uses mathematical modeling and analytical methods to arrive at optimal or near-optimal solutions to complex decision problems. OR was first applied during World War II to solve logistics and operations problems. It involves breaking problems down into components, representing them mathematically, and using analytical methods like linear programming to solve problems. The goal of OR is to determine the best solution to a problem by quantifying variables and using mathematical techniques and computer modeling.
Duality Theory in Multi Objective Linear Programming Problemstheijes
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
The papers for publication in The International Journal of Engineering& Science are selected through rigorous peer reviews to ensure originality, timeliness, relevance, and readability.
Theoretical work submitted to the Journal should be original in its motivation or modeling structure. Empirical analysis should be based on a theoretical framework and should be capable of replication. It is expected that all materials required for replication (including computer programs and data sets) should be available upon request to the authors.
The International Journal of Engineering & Science would take much care in making your article published without much delay with your kind cooperation
This document discusses applying duality theory to solve multi-objective linear programming problems. Three methods are analyzed: weighted sum, e-constraint, and a merged weighted sum/e-constraint approach. The weighted sum approach combines objectives into a single function. The e-constraint approach makes all but one objective new constraints. The merged approach minimizes deviations from goals set for each objective. The methods are demonstrated using data on a bank's investment goals of maximizing profit while minimizing risk and capital requirements. Results show the merged approach best handles the multi-objective problem.
An Interactive Decomposition Algorithm for Two-Level Large Scale Linear Multi...IJERA Editor
This paper extended TOPSIS (Technique for Order Preference by Similarity Ideal Solution) method for solving
Two-Level Large Scale Linear Multiobjective Optimization Problems with Stochastic Parameters in the righthand
side of the constraints (TL-LSLMOP-SP)rhs of block angular structure. In order to obtain a compromise (
satisfactory) solution to the (TL-LSLMOP-SP)rhs of block angular structure using the proposed TOPSIS
method, a modified formulas for the distance function from the positive ideal solution (PIS ) and the distance
function from the negative ideal solution (NIS) are proposed and modeled to include all the objective functions
of the two levels. In every level, as the measure of ―Closeness‖ dp-metric is used, a k-dimensional objective
space is reduced to two –dimentional objective space by a first-order compromise procedure. The membership
functions of fuzzy set theory is used to represent the satisfaction level for both criteria. A single-objective
programming problem is obtained by using the max-min operator for the second –order compromise operaion.
A decomposition algorithm for generating a compromise ( satisfactory) solution through TOPSIS approach is
provided where the first level decision maker (FLDM) is asked to specify the relative importance of the
objectives. Finally, an illustrative numerical example is given to clarify the main results developed in the paper.
This document discusses linear programming and transportation problems. It provides definitions and applications of linear programming, including choice of investments, product mix selection, and design problems. Transportation problems are defined as using linear programming to determine the minimum cost of transporting a commodity from multiple origins to various destinations, given supply and demand constraints. Several examples of transportation problems and their least cost solutions are provided.
Integrating Fuzzy Dematel and SMAA-2 for Maintenance Expensesinventionjournals
: The majority of the allowances being transferred to public institutions are mostly spent for buying new equipment, materials, facilities and their maintenance and repair. Some of the public sectors establish their own plants in order to reduce the maintenance and repair costs and gain ability to perform these activities. However, developing technology and variety of materials make their repair and maintenance activities more expensive for them. In this study, vital criteria for a public institution are determined. By using Fuzzy DEMATEL (Decision Making Trial And Evaluation Laboratory) method the degree of importance is identified by two defuzzification methods and the alternatives are ranked by using SMAA-2 (Stochastic Multi Criteria Acceptability Analysis) in three scenarios. The results show that different defuzzification methods change the order of preferences.
Integrating Fuzzy Dematel and SMAA-2 for Maintenance Expensesinventionjournals
The majority of the allowances being transferred to public institutions are mostly spent for buying new equipment, materials, facilities and their maintenance and repair. Some of the public sectors establish their own plants in order to reduce the maintenance and repair costs and gain ability to perform these activities. However, developing technology and variety of materials make their repair and maintenance activities more expensive for them. In this study, vital criteria for a public institution are determined. By using Fuzzy DEMATEL (Decision Making Trial And Evaluation Laboratory) method the degree of importance is identified by two defuzzification methods and the alternatives are ranked by using SMAA-2 (Stochastic Multi Criteria Acceptability Analysis) in three scenarios. The results show that different defuzzification methods change the order of preferences.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
Unlocking Productivity: Leveraging the Potential of Copilot in Microsoft 365, a presentation by Christoforos Vlachos, Senior Solutions Manager – Modern Workplace, Uni Systems
Cosa hanno in comune un mattoncino Lego e la backdoor XZ?Speck&Tech
ABSTRACT: A prima vista, un mattoncino Lego e la backdoor XZ potrebbero avere in comune il fatto di essere entrambi blocchi di costruzione, o dipendenze di progetti creativi e software. La realtà è che un mattoncino Lego e il caso della backdoor XZ hanno molto di più di tutto ciò in comune.
Partecipate alla presentazione per immergervi in una storia di interoperabilità, standard e formati aperti, per poi discutere del ruolo importante che i contributori hanno in una comunità open source sostenibile.
BIO: Sostenitrice del software libero e dei formati standard e aperti. È stata un membro attivo dei progetti Fedora e openSUSE e ha co-fondato l'Associazione LibreItalia dove è stata coinvolta in diversi eventi, migrazioni e formazione relativi a LibreOffice. In precedenza ha lavorato a migrazioni e corsi di formazione su LibreOffice per diverse amministrazioni pubbliche e privati. Da gennaio 2020 lavora in SUSE come Software Release Engineer per Uyuni e SUSE Manager e quando non segue la sua passione per i computer e per Geeko coltiva la sua curiosità per l'astronomia (da cui deriva il suo nickname deneb_alpha).
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Building Production Ready Search Pipelines with Spark and MilvusZilliz
Spark is the widely used ETL tool for processing, indexing and ingesting data to serving stack for search. Milvus is the production-ready open-source vector database. In this talk we will show how to use Spark to process unstructured data to extract vector representations, and push the vectors to Milvus vector database for search serving.
Sudheer Mechineni, Head of Application Frameworks, Standard Chartered Bank
Discover how Standard Chartered Bank harnessed the power of Neo4j to transform complex data access challenges into a dynamic, scalable graph database solution. This keynote will cover their journey from initial adoption to deploying a fully automated, enterprise-grade causal cluster, highlighting key strategies for modelling organisational changes and ensuring robust disaster recovery. Learn how these innovations have not only enhanced Standard Chartered Bank’s data infrastructure but also positioned them as pioneers in the banking sector’s adoption of graph technology.
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
Driving Business Innovation: Latest Generative AI Advancements & Success StorySafe Software
Are you ready to revolutionize how you handle data? Join us for a webinar where we’ll bring you up to speed with the latest advancements in Generative AI technology and discover how leveraging FME with tools from giants like Google Gemini, Amazon, and Microsoft OpenAI can supercharge your workflow efficiency.
During the hour, we’ll take you through:
Guest Speaker Segment with Hannah Barrington: Dive into the world of dynamic real estate marketing with Hannah, the Marketing Manager at Workspace Group. Hear firsthand how their team generates engaging descriptions for thousands of office units by integrating diverse data sources—from PDF floorplans to web pages—using FME transformers, like OpenAIVisionConnector and AnthropicVisionConnector. This use case will show you how GenAI can streamline content creation for marketing across the board.
Ollama Use Case: Learn how Scenario Specialist Dmitri Bagh has utilized Ollama within FME to input data, create custom models, and enhance security protocols. This segment will include demos to illustrate the full capabilities of FME in AI-driven processes.
Custom AI Models: Discover how to leverage FME to build personalized AI models using your data. Whether it’s populating a model with local data for added security or integrating public AI tools, find out how FME facilitates a versatile and secure approach to AI.
We’ll wrap up with a live Q&A session where you can engage with our experts on your specific use cases, and learn more about optimizing your data workflows with AI.
This webinar is ideal for professionals seeking to harness the power of AI within their data management systems while ensuring high levels of customization and security. Whether you're a novice or an expert, gain actionable insights and strategies to elevate your data processes. Join us to see how FME and AI can revolutionize how you work with data!
For the full video of this presentation, please visit: https://www.edge-ai-vision.com/2024/06/building-and-scaling-ai-applications-with-the-nx-ai-manager-a-presentation-from-network-optix/
Robin van Emden, Senior Director of Data Science at Network Optix, presents the “Building and Scaling AI Applications with the Nx AI Manager,” tutorial at the May 2024 Embedded Vision Summit.
In this presentation, van Emden covers the basics of scaling edge AI solutions using the Nx tool kit. He emphasizes the process of developing AI models and deploying them globally. He also showcases the conversion of AI models and the creation of effective edge AI pipelines, with a focus on pre-processing, model conversion, selecting the appropriate inference engine for the target hardware and post-processing.
van Emden shows how Nx can simplify the developer’s life and facilitate a rapid transition from concept to production-ready applications.He provides valuable insights into developing scalable and efficient edge AI solutions, with a strong focus on practical implementation.
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
Pushing the limits of ePRTC: 100ns holdover for 100 daysAdtran
At WSTS 2024, Alon Stern explored the topic of parametric holdover and explained how recent research findings can be implemented in real-world PNT networks to achieve 100 nanoseconds of accuracy for up to 100 days.
HCL Notes und Domino Lizenzkostenreduzierung in der Welt von DLAUpanagenda
Webinar Recording: https://www.panagenda.com/webinars/hcl-notes-und-domino-lizenzkostenreduzierung-in-der-welt-von-dlau/
DLAU und die Lizenzen nach dem CCB- und CCX-Modell sind für viele in der HCL-Community seit letztem Jahr ein heißes Thema. Als Notes- oder Domino-Kunde haben Sie vielleicht mit unerwartet hohen Benutzerzahlen und Lizenzgebühren zu kämpfen. Sie fragen sich vielleicht, wie diese neue Art der Lizenzierung funktioniert und welchen Nutzen sie Ihnen bringt. Vor allem wollen Sie sicherlich Ihr Budget einhalten und Kosten sparen, wo immer möglich. Das verstehen wir und wir möchten Ihnen dabei helfen!
Wir erklären Ihnen, wie Sie häufige Konfigurationsprobleme lösen können, die dazu führen können, dass mehr Benutzer gezählt werden als nötig, und wie Sie überflüssige oder ungenutzte Konten identifizieren und entfernen können, um Geld zu sparen. Es gibt auch einige Ansätze, die zu unnötigen Ausgaben führen können, z. B. wenn ein Personendokument anstelle eines Mail-Ins für geteilte Mailboxen verwendet wird. Wir zeigen Ihnen solche Fälle und deren Lösungen. Und natürlich erklären wir Ihnen das neue Lizenzmodell.
Nehmen Sie an diesem Webinar teil, bei dem HCL-Ambassador Marc Thomas und Gastredner Franz Walder Ihnen diese neue Welt näherbringen. Es vermittelt Ihnen die Tools und das Know-how, um den Überblick zu bewahren. Sie werden in der Lage sein, Ihre Kosten durch eine optimierte Domino-Konfiguration zu reduzieren und auch in Zukunft gering zu halten.
Diese Themen werden behandelt
- Reduzierung der Lizenzkosten durch Auffinden und Beheben von Fehlkonfigurationen und überflüssigen Konten
- Wie funktionieren CCB- und CCX-Lizenzen wirklich?
- Verstehen des DLAU-Tools und wie man es am besten nutzt
- Tipps für häufige Problembereiche, wie z. B. Team-Postfächer, Funktions-/Testbenutzer usw.
- Praxisbeispiele und Best Practices zum sofortigen Umsetzen
Infrastructure Challenges in Scaling RAG with Custom AI modelsZilliz
Building Retrieval-Augmented Generation (RAG) systems with open-source and custom AI models is a complex task. This talk explores the challenges in productionizing RAG systems, including retrieval performance, response synthesis, and evaluation. We’ll discuss how to leverage open-source models like text embeddings, language models, and custom fine-tuned models to enhance RAG performance. Additionally, we’ll cover how BentoML can help orchestrate and scale these AI components efficiently, ensuring seamless deployment and management of RAG systems in the cloud.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Best 20 SEO Techniques To Improve Website Visibility In SERPPixlogix Infotech
Boost your website's visibility with proven SEO techniques! Our latest blog dives into essential strategies to enhance your online presence, increase traffic, and rank higher on search engines. From keyword optimization to quality content creation, learn how to make your site stand out in the crowded digital landscape. Discover actionable tips and expert insights to elevate your SEO game.
Full-RAG: A modern architecture for hyper-personalizationZilliz
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
How to Get CNIC Information System with Paksim Ga.pptx
Ey36927936
1. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
RESEARCH ARTICLE
www.ijera.com
OPEN ACCESS
A Compromise Weighted Solution For Multilevel Linear
Programming Problems
Osman M. S.A, Gadalla M. H.B, Zeanedean R. A.C, Rabie R. M.D٭
a
(El-Asher University, 10th of Ramadan City, Egypt)
(Department of Mechanical Design and Production, Faculty of Engineering, Cairo University, Egypt)
c
(Department of Operations Research, , Institute of Statistical Studies and Research, Cairo University, Egypt)
d٭
(Department of Operations Research, Institute of Statistical Studies and Research, Cairo University, Egypt)
b
ABSTRACT
Decision making is the process of selecting a possible course of action from all available alternatives. Many real
world physical situations can be categorized as hierarchical optimization problems and be formulated as Multilevel Programming (MLP) models. Instead of solid optimality concept, it is more accuracy adopting the
satisfaction concept that play an important role in the analysis of hierarchical structures and no assumptions or
information are required regarding the Decision Makers (DMs) utility function. In this article a compromise
weighted solution is presented for MLP problems, where a non-dominated solution set is obtained. In weighting
approach, the relative weights represent the relative importance of the objective functions for all DMs whose
provide their preferences of their decision variables that is the lower and upper-bounds to the decision variables
they control. The hierarchical system is converted into Scalar Optimization Problem (SOP) by finding proper
weights using the Analytic Hierarchy Process (AHP) so that objective functions can be combined into a single
objective. A brief historical overview and a comparative study is presented for some approaches used in solving
MLP problem with the solution obtained in the weighting approach with two cases collateral numerical
illustrative examples.
Keywords - Multi level decision making; hierarchical structures; weighting approach; scalar optimization
problem; analytic hierarchy process.
I.
INTRODUCTION
Hierarchical data structures are very common
in the social and behavioral sciences and Multi-level
(ML) decision making models are developed for
analyzing hierarchically structured data. So, MLP is an
important branch of Operation Research, this problem
consists of two or more levels, namely; first level,
second level, and so on up to last level. MLP problem
is a sequence of many optimization problems in which
the constraints region of one is determined by the
solution of other DMs. The first (higher, upper) level
Decision Maker (DM1) is called the center (leader).
The lower-levels Decision Makers (DM2, DM3 …)
called followers. They execute their policies after the
decision of higher levels DMs and then the leader
optimizes his objective independently but may be
affected by the reaction of the followers. ML decision
making models are used for representing many
hierarchical optimization situations in real word
strategic, planning, and management such as; financial
control, economic analysis, facility location,
government regulation, organizational management,
conflict resolution, network design, traffic assignment,
planning
for
resource
signal
optimization,
management, defense, transportation, central economic
planning at the regional or national level to create
model problems concerning organizational design [1,
2, 3].
www.ijera.com
ML decision making often involves many uncertain
factors and it is hard to formulate. Contributions had
been delivered by mathematicians, economists,
engineers and many other researchers and developers.
In first time, Bi-Level Programming (BLP) (as a
special case of MLP) is introduced by Von
Stackelberg in the context of unbalanced economic
markets. After that moment this field has obtained a
rapid development and intensive investigation in both
theories and applications. Much effort has been done
on the development of both linear and nonlinear ML
decision making modeling and solution methods. The
study of MLP problems is not vast and wide as
compared with BLP problems in the literature. Over
the last three decades, tremendous amount of research
effort has been made on MLP for hierarchical
decentralized planning problems leading to the
publication of many interesting results in the literature
and many methodologies have been proposed to solve
it potentially [4, 5].
MLP problem can be defined as a p-person,
non-zero sum game with perfect information in which
each player moves sequentially from top to bottom.
ML decentralized models is characterized by a center
that controls more than one independent divisions on
the lower-levels. For instance, by adopting three
criteria with respect to; strategic, production and
operational planning as objective functions for three
927 | P a g e
2. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
different levels, MLP problem; that is Tri-Level
Programming (TLP) problem can be set for
hierarchical decision situation in firms with three
different DMs in three different levels, one DM on
each level [6, 7].
Multi objective decision making solutions
procedure cannot be directly applied to MLP problem,
since in MLP problem, DMs are on different
hierarchical levels and each one controls only a subset
of the decision variables. There are two main types of
uncertainties in modeling MLP problems; one is that
the parameter values in the objective functions and
constraints of the leader and the followers may be
uncertain or inaccurate; another type of uncertainties
involves the form of the objective functions and
constraint functions. That is, how to determine the
relationships among proposed decision variables and
formulate these functions for a real decision problem
[8].
Unfortunately, MLP problems are difficult to
solve and not every problem has a solution even though
it has a nonempty compact feasible set and it have been
proved to be NP-hard. The features of it, mainly its
nonconvexity, make it difficult one, even when all
involved functions are linear. Also, there are some
difficulties from nonuniqueness of lower-levels optimal
solutions and on its optimality conditions [See, 9, 10].
This article will be organized as: a short
overview of ML models, its use, history, characteristics
and formulation is presented in section 2, AHP concept
and non-dominated solution in section 3. Section 4
provides a weighting approach for generating nondominated solution for MLP problem. Two numerical
illustrative examples and a short discussion are
presented in section 5. The article will be finalized with
its conclusion.
II.
MLP problems Characterizing and
Formulation
MLP problems are characterized that a DM at
a certain level of the hierarchy may have his objective
function and decision space determined partially by
other levels where each DM controls over some
decision variables. So, the followers can take part of the
system decision which be concerned by their control
variables because they always try to optimize their
objective functions but they must take the goal or
preference of the leader into consideration. DM1
defines his objective function and decision variables,
this information then constrains the DM2’s feasible
space and so on. So, the preference information is
delivered from the upper-levels to the lower-levels
sequentially. The geometric properties of the linear
MLP problems are obtained in [11] for general maxmin problem and presented in [5] for the linear BLP
problem. In [7] showed that when all the functions of
the MLP problem are linear and its feasible region is a
polyhedron, the optimal solution occurs at a vertex of
www.ijera.com
www.ijera.com
feasible region. MLP is particularly appropriate for
problems with the following characteristics [12]:
1) The system has interactive decision
making units within a predominantly
hierarchical structure.
2) The external effect on a DM’s problem
can be reflected in both his objective
function and his set of feasible
decisions.
3) The loss of cost of one level is unequal
to the added gain to other level.
4) The order of the play is very important
and the choice of the upper-level limits
affects the choice or strategy of the
lower-levels.
5) The execution of decision is sequential,
from upper to lower-levels.
6) Each DM controls only a subset of the
decision variables.
7) Each level optimizes its own objective
function independently apart from other
levels.
8) Each DM is fully informed about all
prior choices.
TLP problem’s formulation has different
versions that are given in many articles. Linear TLP
problem can be formulated as follows [13]:
max f1(X) = c11x1 + c12x2 + c13x3,
x1
where, x2 and x3 solve:
max f2(X) = c21x1 + c22x2 + c23x3,
x2
where, x3 solves:
max f3(X) = c31x1 + c32x2 + c33x3
x3
s.t. A1x1 + A2x2 + A3x3 ≤ b,
x1, x2, x3 ≥ 0.
Where, X=(x1, x2, x3) denote the decision
variables under control of DM1, DM2 and DM3
respectively. For i =1, 2, 3, xi is ni-dimensional decision
variable, and fi(X) is the related objective function to 1st,
2nd, and 3rd level, respectively. Let X = x1∪ x2∪ x3 and n
= n1 + n2 + n3 then, c11, c21, c31 are constant row vectors
of size (1×n1), c12, c22, c32 are of size (1×n2) and c13, c23,
c33 are of size (1×n3), b is an m-dimensional constant
column vector, and Ai is an m × ni constant matrix.
Each DM has to improve his strategy from a jointly
dependent set S ;
S = {X | A1x1+A2x2 +A3x3 ≤ b, x1, x2, x3 ≥0}.
Solution approaches can be classified into
four categories; extreme point search, transformation
approach, descent and heuristic and evolutionary
approach [10]. While, in [14] an additional category is
added, interior points approach through the neural
network approaches. According to the stages of
development, these methods can be classified only into
928 | P a g e
3. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
two categories; first one, extreme point search,
transformation approach, and descent and heuristic can
be referred to as the traditional approaches, and second
one, intelligent computation or evolutionary approach
and interior point approach are based on more recent
developments. Computational methods are diverse
from vertex enumeration approaches such as Kth-best
algorithm [15, 16, 17], Kuhn-Tucker approaches, [18,
19] to penalty function approaches [20]. New feasible
and efficient algorithms are presented for solving BLP
and TLP problems in [21, 22] respectively.
When formulated problems are such difficult
classes of optimization problems and consequently it is
difficult to obtain exact its optimal solutions, DMs may
require approximate optimal solutions. Fuzzy
approaches are proposed for obtaining non-dominated
solutions using fuzzy membership functions and the
tolerance concept which simplifies the representation
and the computations for the compromises among
levels. The basic concept is the same as implies that
each lowest level DM optimizes his objective function,
taking a goal or preference of the upper-level DM into
consideration. An effective fuzzy method by using the
concept of the tolerance membership function of fuzzy
set theory to MLP problems is developed in [6] and is
extended in [23] for satisfactory solution. A fuzzy
approach for MLP problems that is a supervised search
procedure with the use of max–min operator presented
in [24] to simplify the complex nested structure by
utilizing the concept of the degree of satisfaction, in
terms of fuzzy membership functions. In [25], further
extension for Lai’s concept, [6] by introducing the
compensatory fuzzy operator. In [26, 27], some
developing for alternative MLP techniques based on
fuzzy mathematical programming. A fuzzy goal
programming procedure for solving quadratic BLP
problems presented in [28] and the work in [29]
presented for solving BLP and TLP non-linear
multiobjective problems as an extension of the fuzzy
approach for MLP problems in [22]. In [30], a
presentation of a fuzzy goal programming method to
overcome such difficulties in MLP problems for proper
distribution of decision powers to the DMs to arrive at
a satisfaction decision for overall benefit of the
organization.
Interactive procedures have met with a great
success with such situations include full cooperation
among DMs without predetermined preference
information, by using interactive and fuzzy interactive
methods, MLP problem can be solved, giving the best
satisfactory results where the leader satisfies his
maximal (updated maximal) satisfaction level and
also, each DM in lower-levels accepts his satisfactory
level. The basic concept is that the computational
complexity with re-evaluation of the problem
repeatedly by redefining the elicited membership
functions values in the solution search process for
searching higher degree of satisfaction and obtaining
the satisfactory solutions. In [31], suggestion of an
interactive
approach
for
nonlinear
bi-level
www.ijera.com
www.ijera.com
multiobjective decision making problem, while in
[32], an interactive fuzzy programming for linear
MLP problems is presented. In [33], an interactive
fuzzy programming for 0–1 MLP problems through
genetic algorithms is proposed. Interactive fuzzy
programming approaches for both linear fractional and
decentralized BLP problems are presented in [34, 35].
In [36], there is a presentation of weighting method
for BLP. A new algorithm for solving BLP problems
is presented in [24] and in [37] a global optimization
algorithm for solving linear fractional BLP problem.
Recently, an assignment scheme of relative
satisfaction for the higher-level DM is proposed in
[38] to ensure his leadership and therefore prevent the
paradox problem reported in the literature, where
lower-level DMs have higher satisfaction degrees than
that of the higher-level DM. a fuzzy TOPSIS
(technique for order preference by similarity to ideal
solution ) algorithm is proposed in [39] to solve BL
multi-objective decision making problems, the model
is a multiple criteria method to identify solutions from
a finite set of alternatives based upon simultaneous
minimization of distance from an ideal point and
maximization of distance from a nadir point for
getting the satisfactory solution. an approach based on
particle swarm optimization is proposed to solve
nonlinear BLP problem in [40] by applying KuhnTucker condition to the lower-level problem and
transforming the problem into a regular nonlinear
programming with complementary constraints, then
the approach is applied for getting the approximate
optimal solution. Using the concept of chance
constraints, an interactive fuzzy programming method
for stochastic BLP is proposed in [41]. It has an
advantage that candidates for a satisfactory solution
can be easily obtained through the combined use of
the bisection method and the phase one of the simplex
method. An explicit solution to MLP problems is
presented in [19], and a new algorithm for solving
linear TLP problems in [25] and in [26] a fuzzy
mathematical programming applied to MLP problems
is developed.
Compromise or coordination is usually
needed in order to reach a satisfactory solution, even in
noncooperative environments. Most real world
decision problems involve multiple criteria that are
often conflict in general and it is sometimes necessary
to conduct trade-off analysis in multiple criteria
decision analysis. Because of the special nature of the
problem and the need of adopting some cooperation
among DMs, many approaches had been presented to
solve MLP problems mostly based on fuzzy and
interaction concepts. While BLP is a special case of
MLP, and only a special case, is considered in [36], the
main motivation in this submission was studying its
applicability with the general state, MLP. In literature,
any solution approach used for special cases needs
more studies while used for the general case. In this
article, an extension work of [36] is considered, where
the weighting approach allows DMs to provide two
929 | P a g e
4. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
issues; their preferences bound for the decision
variables that are the lower and upper-bounds for it,
and their assigned importance for objective functions
in all levels. In weighting approach the hierarchical
system will be converted into SOP by finding the
proper weights for all objective functions and pairwise
comparisons manner using AHP [42, 43, 44] so that
objective functions of three levels can be combined
into a single objective function, where its relative
weights represent the relative importance of DMs’s
objective functions. After assessing the consistency of
the pairwise judgments, a non-dominated solution set is
obtained. Perhaps the most creative task in making a
decision with the hierarchical situations is to choose
the factors that are important for that decision.
III.
AHP and Non-dominated solution
AHP is a mathematical technique developed
for incorporating multi criteria decision making and
designed to solve its complex problems. AHP and
similar methods often use pairwise comparison
matrices for determining the scores of alternatives with
respect to a given criterion, or determining values of a
weight vector. There are many papers applied AHP to
solve decision problem. For example, in [45], over 100
applications of AHP in the service and government
sectors are studied. While, the majority practitioner
agreed to use the effective mathematical technique,
eigenvector method proposed in [42], some researchers
suggested other choices such as mean transformation,
or row geometric mean. For example, in [46, 47] a
refined method to adjust the maximum entry being one
for the weight of alternatives is developed; in [48] a
usage of the geometric mean method instead of the
eigenvector method. The process requires each DM to
provide judgments about the relative importance of his
objective and then specify a preference for it for each
other’s.
AHP can be conducted in three steps; perform
pairwise comparisons, assess consistency of pairwise
judgments, compute the relative weights and then, it is
enables DM to make pairwise comparisons of
importance between objectives according to the scale
in table (1).
Because human is not always consistent, the
theory of AHP does not demand perfect consistency
and allows some small inconsistency in judgment and
provides a measure of inconsistency. Before computing
the weights based on pairwise judgments, the degree of
inconsistency is measured by the Consistency Index
(CI). Perfect consistency implies a value of zero for CI.
Therefore, it is considered acceptable if CI ≤ 10%. For
CI values greater than 10%, the pairwise judgments
may be revised before the weights are computed.
Option
www.ijera.com
Numerical value(s)
Equal
Marginally strong
Strong
Very strong
Extremely strong
Intermediate judgment
values for fuzzy inputs
1
3
5
7
9
2, 4, 6, 8
Table (1): Gradation scale for quantitative comparison of alternatives
Mathematically, the weighting method can be
stated as follows:
The weights wp operating on fp(X), can be
interpreted as ‘‘the relative weight or worth’’ of that
objective function when compared to other’s then, the
solution for previous problem is equivalent to the best
compromise solution, i.e., the optimal solution relative
to a particular preference structure. Moreover, this
optimal solution is a non-dominated solution provided
all the weights are positive. Allowing negative weights
would be equivalent to transforming the maximizing
problem to a minimizing one, for which a different set
of non-dominated solutions will be exist. The trivial
case where all the weights are zero will simply identify
X S as an optimal solution and will not distinguish
between dominated and non-dominated solutions [36].
The concept of non-dominated solution was
introduced by Pareto, an economist in 1896. A
preferred (best) solution is a non-dominated solution
which is chosen by the DM his self that is lies in the
region of acceptance of all DMs. Non-dominated
solution is to design the best alternative by considering
the various interactions within the design constraints
that best satisfy the DM by way of obtaining some
acceptable levels of quantifiable objective functions.
This method be distinguished with; a set of quantifiable
objective functions, a set of well defined constraints
and a process of obtaining some trade-off information,
between the stated quantifiable objective functions.
The most common strategy for finding non-dominated
solutions of MLP problems is to convert it into a SOP.
DMs provide their preference and converting MLP
problem into a SOP by finding vector of weights for
*
objectives. A feasible solution X S is a nondominated solution if there does not exists any other
feasible solution X S such that:
IV.
Weighting approach for MLP
problems
Weighting approach does not require any
assumptions or information regarding DMs utility
function. Considering, the procedure of AHP
www.ijera.com
930 | P a g e
5. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
methodology in three steps; inputs (importance of
objectives – bounds of variables), model and output
(ranked priorities). In the weighting problem P(w) in
the absence explicit preference structure, the strategy is
to generate all or representative subsets of nondominated solutions from which a DM can select the
suitable solution. A Linear TLP problem is represented
as:
max f1(X)
x1
max f2(X)
x2
max f3(X)
x3
s.t. A1x1 + A2x2 + A3x3 ≤ b,
x1, x2, x3 ≥ 0.
Where, f1(X), f2(X) and f3(X) and constraints
*
are linear functions. Solving SOP involves finding X
S such that fp(X*) ≥ fp(X) X S . The point X* is said
to be global optimum. If strict inequality holds for the
*
objective functions, then X is the unique global
optimum. If the inequality holds for some
*
*
neighborhood of X , then X is a local or relative
optimum while it is strict local optimum if strict
*
inequality holds in a neighborhood of X . By using the
AHP pairwise comparison process, weights or priorities
are derived from a set of judgments. While it is difficult
to justify weights that are arbitrarily assigned, it is
relatively easy to justify judgments and the basis (hard
data, knowledge, experience) for the judgments.
Suppose already the relative weights of three objective
functions are known, for TL hierarchical objective
functions a complete pairwise comparison matrix A can
be expressed as; A=[aij] i,j =1, 2, 3 is a matrix of size
3×3 with the following properties; aij > 0, aii =1, and
aij=1/aji for i,j=1, 2, 3, where aij is the numerical
answer given by the each DM for the question “How
many times objective i is more important than objective
j?”
www.ijera.com
LP and UP are the lower and upper-bounds of
decision variables provided by the respective DM. The
previous problem, with a single objective function is
solved. Here the weighting coefficients convey the
importance attached to objective functions. Suppose
that the relative importance of all objective functions
and the bounds of the variables are known then the
preferred solution is obtained by solving P(w) with
infinite number of selections through varying of weight
vectors as shown in fig. 1.
The weighting approach is adopting in this
article because it is related to the interactive
techniques and belongs to the cooperative direction
for dealing with the hierarchical structure situations in
which applying the satisfaction concept is more
suitable than optimality concept to achieve overall
satisfactory level among all decision makers that
satisfies their preferences or importance. The
weighting approach generates
non-dominated
solutions by utilizing various values of W. In such a
case the weighting coefficients W do not reflect the
relative importance of the objective functions in the
proportional sense, but are only parameters varied to
locate the non-dominated points [49]. Solution
techniques derived in the MLP problems literature
often assume uniqueness [5], which is what is done in
the exposition of this article as well.
After the normalized matrix, N of pairwise
comparison matrix A for a hierarchical TL structure is
designed, the normalized principal eigen vector
(priority vector) can be obtained by some ways such as
averaging across the rows where, it shows the relative
weights for objectives. The weighting problem is to
find the 3-dimensional weight vector W=(w1,w2,w3)T
such that the appropriate ratios of the components of W
reflect or, at least, approximate all the aij values (i, j=1,
2 ,3), given by DMs. Then, the weighting problem for
linear TLP becomes as follows:
Fig. 1: weighted combinations tree for one decimal value
www.ijera.com
931 | P a g e
6. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
V.
www.ijera.com
Illustrative Examples
Example 1: Consider the following numerical TLP
problem [23];
max f1 ( x1 , x2 , x3 ) 7 x1 3x2 4 x3 ,
x1
where x 2 and x3 solve:
max f 2( x1 , x2 , x3 ) x2 ,
w2
w3
x1, x2, x3
(
f1, f2, f3
#
0.0
0.1
0.0 ….
0.9
1.0
1.0
0.9
….
0.1
0.0
1, 1, 1
1, 1, 1
….
1, 1, 1
1, 1, 1
1.0
1.0
….
1.0
1.0
6, 1, 1
6, 1, 1
….
6, 1, 1
6, 1, 1
11
0.0
0.1
0.1 ….
0.8
0.9
0.9
0.8
….
0.1
0.0
1, 1, 1
1, 1, 1
….
1, 1, 1
1, 1, 1
1.5
1.5
….
1.5
1.5
6, 1, 1
6, 1, 1
….
6, 1, 1
6, 1, 1
10
….
….
….
….
1, 1, 1
1, 1, 1
1, 1, 1
1, 1, 1
1, 1, 1
1, 1, 1
3.5
3.5
3.5
3.5
3.5
3.5
6, 1, 1
6, 1, 1
6, 1, 1
6, 1, 1
6, 1, 1
6, 1, 1
6
w1
x2
where
x3 solves:
max f 3 ( x1 , x2 , x3 ) x3
x3
st:
x1+ x2+ x3 ≤ 3,
x1+ x2 - x3 ≤ 1,
x1+ x2+ x3 ≥ 1,
-x1+ x2+ x3 ≤ 1,
x3 ≤ 0.5,
x1, x2, x3 0.
The pairwise comparison matrix, A of order 3
and its normalized matrix, N for the hierarchical TLP
objective functions are given as:
…. …. ….
0.0
0.1
0.2
0.5
0.3
0.4
0.5
0.5
0.4
0.3
0.2
0.1
0.0
…. …. ….
….
….
0.0 0.1 1, 0.5, 0.5 5.9
0.1 0.0 1, 0.5, 0.5 5.9
6.5, 0.5, 0.5
6.5, 0.5, 0.5
2
1.0 0.0 0.0 1, 0.5, 0.5 6.5
6.5, 0.5, 0.5
1
0.9
Table (2): 66 different weighted combinations and solutions for
The following priority vector that is
normalized relative weights
W=(w1,w2,w3)T can be
obtained by;
The principal eigen value; λmax=1.75(0.58)+
4(0.24) + 6(0.18) =3.055. Then, the consistency index
(CI) = (λ max – n)/n - 1=(3.055– 3)/2 =0.0275 where, n
denote number of comparisons. While Random
Consistency Index (RI)=0.58. Then, the Consistency
Ratio (CR) = CI/RI = 0.0275/0.58 = 0.474% ˂0.10%
(accepted ratio) and A is a consistent matrix.
Weighting approach for solving TLP problem
achieves the non-dominated solution and according to
the related increased decimal points for objective
functions weights, the number of weight vectors
increase more and more. Example 1, shows that while
varying the infinite number of different weight
vectors; the solution remains more or less the nondominated one where, for one decimal point, 66
weight vectors are set as in table (2) and it is
increasing more and more for two decimal points as
shown in table (3) and so on.
www.ijera.com
one decimal value for weights
The individual problems for each DM are
calculated in his level subject to the set of constraints
to determine his optimal solution as;
f1=8.5 at (1.5, 0, 0.5),
f2=1 at (0, 1, 0) and
f3=0.5 at (0, 0.5, 0.5), (0.5, 1, 0.5) or (1.5, 0, 0.5).
Lower and upper-bounds are arbitrary values
or it is assumed by its individual optimal solution in
all levels problems. In other words, lower and upperbounds are represented by obtained minimum &
maximum values from the individual problems in all
levels. Changes in lower and upper-bounds values
reflect the flexibility in the approach that translates the
preferences of all decision makers.
Assuming that the lower and upper-bounds
provided for the decision variables by DMs are as
follows; 0≤ x1 ≤ 1.5, 1 ≤ x2 ≤ 2 and x3 =0.5 or all
variables in the closed interval [0, 1], with note that
these bounds are set from the individual solutions for
each level. Hence, the weighting problem is therefore
formulated as:
932 | P a g e
7. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
w2
w1
0.56
0.57
0.58
0.59
0.60
w3
x1, x2, x3
( )
f1, f2, f3
0.00
0.01
….
0.43
0.44
0.00
0.01
….
0.42
0.43
0.00
0.01
….
0.23
0.24
0.25
….
0.41
0.42
0.00
0.01
….
0.40
0.41
0.44
0.43
….
0.01
0.00
0.43
0.42
….
0.01
0.00
0.42
0.41
….
0.19
0.18
0.17
….
0.01
0.00
0.41
0.40
….
0.01
0.00
1, 0.5, 0.5
1, 0.5, 0.5
….
1, 0.5, 0.5
1, 0.5, 0.5
1, 0.5, 0.5
1, 0.5, 0.5
….
1, 0.5, 0.5
1, 0.5, 0.5
1, 0.5, 0.5
1, 0.5, 0.5
….
1, 0.5, 0.5
1, 0.5, 0.5
1, 0.5, 0.5
….
1, 0.5, 0.5
1, 0.5, 0.5
1, 0.5, 0.5
1, 0.5, 0.5
….
1, 0.5, 0.5
1, 0.5, 0.5
3.86
3.86
….
3.86
3.86
3.92
3.92
….
3.92
3.92
3.98
3.98
….
3.98
3.98
3.98
….
3.98
3.98
4.04
4.04
….
4.04
4.04
6.5, 0.5, 0.5
6.5, 0.5, 0.5
….
6.5, 0.5, 0.5
6.5, 0.5, 0.5
6.5, 0.5, 0.5
6.5, 0.5, 0.5
….
6.5, 0.5, 0.5
6.5, 0.5, 0.5
6.5, 0.5, 0.5
6.5, 0.5, 0.5
….
6.5, 0.5, 0.5
6.5, 0.5, 0.5
6.5, 0.5, 0.5
….
6.5, 0.5, 0.5
6.5, 0.5, 0.5
6.5, 0.5, 0.5
6.5, 0.5, 0.5
….
6.5, 0.5, 0.5
6.5, 0.5, 0.5
0.00
0.01
….
0.39
0.40
0.40
0.39
….
0.01
0.00
1, 0.5, 0.5
1, 0.5, 0.5
….
1, 0.5, 0.5
1, 0.5, 0.5
4.10
4.10
….
4.10
4.10
6.5, 0.5, 0.5
6.5, 0.5, 0.5
….
6.5, 0.5, 0.5
6.5, 0.5, 0.5
#
45
44
43
42
two decimal values for weights
A non-dominated solution set is generated throughout
parametrically varying the weights, then the TLP
problem’s solution, obtained in two cases;
Case (1): with unequal lower and upper-bounds
X=(x1, x2, x3) = (1, 0.5, 0.5), f1, f2, f3 = 6.5, 0.5, 0.5
respectively, with P(w)=3.98.
Case (2): with equal lower and upper-bounds
X=(x1, x2, x3) = (0.5, 1, 0.5), f1, f2, f3 =4.5, 1, 0.5
respectively, with P(w)=2.94.
www.ijera.com
Problem’s solution is calculated using some
approaches such as; the Kth-best algorithm in [17], the
fuzzy approach in [23], and the interactive approach
used in [32]. A brief comparative study for the
solutions is presented using the three mentioned
approaches beside to the weighting approach for
dealing with the TLP problem as one of the famous
models for MLP problems. Then, the DMs satisfaction
levels in both weighting approach and Kth-best
algorithm can be calculated as the ratio of the optimal
solution for the complete TLP problem over the
optimal solution for the individual problem for each
DM.
In the fuzzy approach [23], DMs on the
upper-levels (only) determine the tolerance values for
their decision variables and assuming that x1, x2 should
be around 0.95, 0.58 respectively, with negative and
positive-side tolerances (0.95, 0) and (0.58, 0),
respectively. The interactive fuzzy approach in [32]
provides a solution concept for TLP problems in full
cooperative decision making situations to obtain
satisfactory solutions where fuzzy membership
functions are built for fi where i=1, 2, 3 with
determined minimal satisfaction levels. Lower and
upper-bounds are set for DMs’s overall satisfaction
levels if needed and it is calculated from the ratio
μi+1(fi+1)/μi(fi).
As soon as expected, upper-levels DMs start
their initial minimal satisfactory levels =1.0, and
suppose that lower and upper-bounds of the ratio of
overall satisfactory degrees may be set as [0.5, 1.0].
Table (4) shows the results of example 1, using the
weighting approach in two different cases for the lower
and upper-bounds of decision variables besides other
three different approaches. The results include the
satisfaction level for all DMs represented by the
degrees of the membership functions. Note that the
achieved compromised weighted solutions may be the
same obtained by other methods or around them.
41
Table (3): detailed information of set of non-dominated solutions for
www.ijera.com
x1
x2
x3
f1
f2
f3
μ(f1)
μ(f2)
μ(f3)
Weighting
approach
Case
Case
(1)
(2)
0.5000 1.0000
1.0000 0.5000
0.5000 0.5000
4.5000 6.5000
1.0000 0.5000
0.5000 0.5000
0.5294 0.7647
1.0000 0.5000
1.0000 1.0000
Zhang
et al.
[17]
Shih et
al. [23]
Sakawa
et al.
[32]
0.5000
1.0000
0.5000
4.5000
1.0000
0.5000
0.5294
1.0000
1.0000
0.9200
0.5800
0.5000
6.1800
0.5800
0.5000
1.0000
1.0000
1.0000
0.8450
0.6500
0.5000
5.8650
0.6500
0.5000
0.6900
0.6500
1.0000
Table (4): example 1 results using the weighted approach and other
different approaches
933 | P a g e
8. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
Example 2: Consider the following numerical TLP
problem [23, 27, 32];
max f1 ( X ) 7 x1 3x2 4 x3 2 x 4
x 1, x 2
,
where x 3 and
x 4 solve:
max f 2 ( X ) x2 3x3 4 x4 ,
x3
where
x 4 solves:
max f 3 ( X ) 2 x1 x2 x3 x 4
x4
st: x1+ x2+ x3+x4≤ 5,
x1+ x2 - x3 –x4≤ 2,
x1+ x2+ x3 ≥ 1,
-x1+ x2+ x3 ≤ 1,
x1- x2+ x3+2x4≤ 4,
x1+2x3+3x4≤ 3,
x4≤ 2,
x1, x2, x3, x4 0.
The optimal solutions of the individual
problems will be as;
f1=16.25 at (2.25, 0, 0, 0.25),
f2=5 at (1, 0, 1, 0) and
f3=5 at (1.33, 1.5, 0.83, 0).
Given, the DMs preferences to set the pairwise
comparison matrix, B as:
The following priority vector W=(w1,w2,w3)T = (0.31,
0.11, 0.58), the Consistency Ratio (CR) = 0.0072
˂0.10, then, B is a consistent matrix.
Assuming that the lower and upper-bounds
are as follows; 1≤ x1 ≤ 2.25, 0 ≤ x2 ≤ 1.5, 0 ≤ x3 ≤ 1
and 0≤ x4≤ 0.25 or all variables in the closed interval
[0, 2.25]. Hence, the weighting problem objective
function is:
Where, in the two cases the problem solutions are
identical as:
X=(x1, x2, x3, x4) = (2.25, 0, 0, 0.25), f1, f2, f3 = 16.25, 1,
4.75 respectively, with P(w)=7.9025. Table (5) shows
the results of example 2, using the weighting approach
besides other three different approaches.
x1
x2
x3
x4
f1
f2
f3
μ(f1)
μ(f2)
μ(f3)
www.ijera.com
Weighting
approach
Cases (1 & 2)
2.2500
0.0000
0.0000
0.2500
16.2500
1.0000
4.7500
1.0000
0.2000
0.9500
Sinha
[27]
Shih et al.
[23]
1.5900
1.0800
0.6200
0.0600
12.0100
3.18000
4.9400
0.0680
0.0080
0.0000
1.6400
0.9800
0.6800
0.0000
11.7000
3.0200
4.9400
1.0000
1.0000
1.0000
Surapati
et al.
[32]
0.8570
1.8570
0.0000
0.7140
13.0000
4.7100
4.2800
0.7110
0.9280
0.7600
Table (5): example 2 results using the weighted approach and other
different approaches
VI.
Conclusion
AHP gives the relative weights to form a
single objective function while converting the
hierarchical system into SOP by finding proper
weights so that objective functions of all levels can be
combined into a super objective function. In this
article, a compromise weighted approach is applied to
solve MLP problem with testing the applicability of
the weighting approach for the MLP case, checking
the outputs accuracy of applying the weighting
approach in MLP problems by comparing the results
with other applied approaches and the approach was
applied on the MLP problem throughout two different
cases; equal and unequal (individual values) lower and
upper-bounds for the decision variables values for
each decision maker in his level. The approach can be
applicable as satisfactory or an approximation solution
for; ML fractional programming problems and
nonlinear MLP problems. The proposed approach is
effective tool for finding a satisfactory (near optimal)
solution where it can produces results which are very
close or improved to the results obtained by most of
the other existing methods with observing that even
though varying the weight vectors, the solutions
remain more or less the same. This approach
determines a set of non-dominated solutions and
unique characteristic of a MLP problem is with this
approach reflected by allowing each DM to determine
the importance of his objective regarding to other’s
and to assign lower and upper-bounds for the decision
variables under his control. These bounds are
additional constraints. From this set, the DM chooses
the most satisfying solution, making implicit tradeoffs between all objective functions on the different
levels based on some previously un-indicated or nonquantifiable criteria.
REFERENCES
[1]
www.ijera.com
G.
Anandalingam,
A
Mathematical
Programming Model of Decentralized MultiLevel Systems, Journal of Operational
Research Society, 39 (11) (1988) 1021–1033.
934 | P a g e
9. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]
E. Anderson and N. Joglekar, A Hierarchical
Product Development Planning Framework,
Production and Operations Management, 14
(3) (2005) 344-361.
O. Ben-Ayed, Bi-Level Linear Programming,
Computers and Operations Research, 20
(1993) 485–501.
J. F. Bard, An Algorithm for Solving the BiLevel Programming Problem, Mathematics of
Operation Research, 8 (2) (1983) 260–270.
J. F. Bard, Optimality Conditions for the BiLevel Programming Problem, Naval Research
Logistics Quarterly, 31 (1984) 13–26.
Y.J. Lai, Hierarchical Optimization: a
Satisfactory Solution, Fuzzy Sets and
Systems, 77 (1996) 321–335.
J. F. Bard, Geometric Algorithmic
Developments for a Hierarchical Planning
Problem, European Journal of Operational
Research, 19 (1985) 372-383.
H.P. Benson, On the Structure and Properties
of a Linear Multi-level Programming
Problem, Journal of Optimization Theory and
Applications, 60 (1989) 353–373.
W. Candler, M.H. Karwan, A Linear Two
Level Programming Problem, Computers and
Operation Research, 9 (1) (1982) 59–76.
E.S. Lee, H.S. Shih, Fuzzy and Multi-Level
Decision Making, 1st edition, London:
Springer, 2001, Chapters 1, 2.
J. Falk, A Linear Max-Min Problem,
Mathematical Programming, 5 (1973) 169-181.
O. Ben-Ayed, C.E. Blair, Computational
Difficulties of Bi-level Linear Programming,
Operations Research, 38 (1988) 556–560.
G. Anandalingam and T.L. Friesz, Hierarchical
Optimization: an Introduction, Annals of
Operations Research, 34 (1) (1992) 1–11.
H.S. Shih, U.P. Wen, E.S. Lee, K.M. Lan and
H.C. Hsiao, A Neural Network Approach to
Multi-objective and Multi-level Programming
Problems, Computers and Mathematics with
Applications, 48 (2004) 95-108.
W. F. Bialas and M.H. Karwan, Two Level
Linear Programming, Management Science, 30
(1984) 1004–1020.
H. I. Calvete and C. Gale, Solving Linear
Fractional Bi-Level Programs, Operations
Research Letters, 32 (2004) 143-151.
G. Zhang, J. Lu, J. Montero and Y. Zeng,
Model, Solution Concept, and Kth-Best
Algorithm for Linear Tri-Level Programming,
Information Sciences, 130 (2010) 481-492.
J. Fortuny-Amat and B. McCarl, A
Representation and Economic Interpretation of
a Two-Level Programming Problem, the
Journal of the Operational Research Society,
32 (9) (1981) 783–792.
J. F. Bard and J. E. Falk, An Explicit Solution
to the Multi-Level Programming Problems,
www.ijera.com
[20]
[21]
[22]
[23]
[24]
[25]
[26]
[27]
[28]
[29]
[30]
[31]
[32]
[33]
[34]
www.ijera.com
Computers and Operations Research, 9 (1982)
77–100.
L. Vicente, G. Savard and J. J. J´udice,
Discrete Linear Bi-Level Programming
Problem, Journal of Optimization Theory and
Applications, 89 (1996) 597–614.
P. Lasunon, J. Wetweerapong and T.
Remsungnen, A New Algorithm for Solving
Bi-Level Linear Programming Problems,
Proceeding of the 16th Annual Meeting in
Mathematics, Thailand (2011) 59-66.
P. Lasunon and T. Remsungnen, A New
Algorithm for Solving Tri-Level Linear
Programming Problems, Int. J. Pure Appl.
Sci. Technol., 7 (2) (2011) 149-157.
H.S. Shih, Y.J. Lai and E.S. Lee, Fuzzy
Approach for Multi-Level Programming
Problems,
Computers
and
Operations
Research, 23 (1) (1996) 73–91.
R. E. Bellman and L.A. Zadeh, DecisionMaking in a Fuzzy Environment, Manage. Sci.,
17 (1970) 141–164.
H.S. Shih and E.S. Lee, Compensatory Fuzzy
Multiple Level Decision Making , Fuzzy Sets
and Systems, 14 (2000) 71–87.
S. Sinha, Fuzzy Mathematical Programming
Applied
to
Multi-Level
Programming
Problems,
Computers
and
Operations
Research, 30 (2003)a 1259–1268.
S. Sinha, Fuzzy Programming Approach to
Multi-Level Programming Problems, Fuzzy
Sets and Systems, 136 (2003)b 189–202.
B. B. Pal and B.N. Moitra, A Fuzzy Goal
Programming Procedure for Solving Quadratic
Bi-Level Programming Problems, Int. J. Intell.
Syst., 18 (5) (2003) 529–540.
M.S. Osman, M.A. Abo-Sinna, A.H. Amer and
O.E. Emam, A multi-level Nonlinear MultiObjective Decision Making under Fuzziness, J.
Appl. Math. Comp., 153 (2004) 239–252.
P. Surapati and K. R. Tapan, Fuzzy Goal
Programming Approach to Multi-level
Programming Problems, European Journal of
Operational Research, 176 (2007) 1151–1166.
X. Shi and H. Xia, Interactive Bi-Level
Multi-Objective Decision Making, Journal of
the Operational Research Society, 48 (9)
(1997) 943-949.
M. Sakawa, I. Nishizaki and Y. Uemura,
Interactive Fuzzy Programming for MultiLevel
Linear
Programming
Problems,
Computers & Mathematics with Applications,
36 (2) (1998) 71–86.
M. Sakawa, I. Nishizaki and M. Hitaka,
Interactive Fuzzy Programming for MultiLevel 0–1 Programming Through Genetic
Algorithms, European Journal of Operational
Research, 114 (3) (1999) 580–588.
M. Sakawa and I. Nishizaki, Interactive Fuzzy
Programming for Two-Level Linear Fractional
935 | P a g e
10. Osman M. S et al Int. Journal of Engineering Research and Applications
ISSN : 2248-9622, Vol. 3, Issue 6, Nov-Dec 2013, pp.927-936
[35]
[36]
[37]
[38]
[39]
[40]
[41]
[42]
[43]
[44]
[45]
[46]
[47]
[48]
Programming Problems, Fuzzy Sets and
Systems, 119 (2001) 31-40.
M. Sakawa and I. Nishizaki, Interactive Fuzzy
Programming for Decentralized Two-Level
Linear Programming Problems, Fuzzy Sets and
Systems, 125 (2002) 301-315.
S. Mishra, Weighting Method for Bi-level
Linear Fractional Programming Problems,
European Journal of Operational Research,
183 (2007) 296–302.
W. Guangmin, Z. Gao and Z. Wan, A Global
Optimization Algorithm for Solving the BiLevel Linear Fractional Programming
Problem,
Computers
&
Industrial
Engineering, 63 (2012) 428–432.
L. Chen and H. Chen, Considering Decision
Decentralizations to Solve Bi-level MultiObjective Decision-Making Problems: A
fuzzy
approach, Applied
Mathematical
Modeling, In
Press,
Corrected
Proof, Available online March 2013.
I. A. Baky and M. A. Abo-Sinna, TOPSIS for
Bi-level
MODM
Problems, Applied
Mathematical Modeling, 37 (3) (2013) 10041015.
Y. Jiang, X. Li, C. Huang and X. Wu,
Application of Particle Swarm Optimization
Based on CHKS Smoothing Function for
Solving Nonlinear Bi-level Programming
Problem, Applied
Mathematics
and
Computation, 219 (9) (2013) 4332-4339.
M. Sakawa and T. Matsui, Interactive Fuzzy
Programming for Stochastic Two-Level
Linear Programming Problems through
Probability
Maximization,
Artificial
Intelligence Research, 2 (2) (2013) 109-124.
T. L. Saaty, The Analytic Hierarchy Process,
McGraw-Hill, New York, 1980.
T. L. Saaty, Multi-criteria Decision Making:
The Analytic Hierarchy Process, RWS
Publications, Pittsburgh, PA, 1990.
T. L. Saaty, Fundamentals of Decision
Making and Priority Theory with the Analytic
Hierarchy Process, RWS Publications,
Pittsburgh, PA, 1994.
S. Zanakis, T. Mandakovic, S. Gupta, S.
Sahay and S. Hong, A Review of Program
Evaluation and Fund Allocation Methods
within the Service and Government Sectors,
Socio-Economic Planning Science, 29 (1)
(1995) 59-79.
V. Belton and T. Gear, On a Shortcoming of
Saaty’s Method of Analytic Hierarchies,
Omega, 11 (3) (1983) 228-230.
V. Belton and T. Gear, Feedback: the
Legitimacy Of Rank Reversal- a Comment,
Omega, 13 (3) (1985)143-144.
J. Barzilai, Deriving Weights from Pairwise
Comparison Matrices, Journal of the
www.ijera.com
[49]
www.ijera.com
Operational
Research
Society,
48
(1997)1226-1232.
V. Chankong and Y. Y. Haimes, MultiObjective Decision Making: Theory and
Methodology, Elsevier, North-Holland, 1983.
936 | P a g e