A multi-objective linear programming problem is made from fuzzy linear programming problem. It is due the fact that it is used fuzzy programming method during the solution. The Multi objective linear programming probl...A multi-objective linear programming problem is made from fuzzy linear programming problem. It is due the fact that it is used fuzzy programming method during the solution. The Multi objective linear programming problem can be converted into the single objective function by various methods as Chandra Sen’s method, weighted sum method, ranking function method, statistical averaging method. In this paper, Chandra Sen’s method and statistical averaging method both are used here for making single objective function from multi-objective function. Two multi-objective programming problems are solved to verify the result. One is numerical example and the other is real life example. Then the problems are solved by ordinary simplex method and fuzzy programming method. It can be seen that fuzzy programming method gives better optimal values than the ordinary simplex method.展开更多
An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorith...An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.展开更多
Intuitionistic Fuzzy Set (IFS) can be used as a general tool for modeling problems of decision making under uncertainty where, the degree of rejection is defined simultaneously with the degree of acceptance of a piece...Intuitionistic Fuzzy Set (IFS) can be used as a general tool for modeling problems of decision making under uncertainty where, the degree of rejection is defined simultaneously with the degree of acceptance of a piece of information in such a way that these degrees are not complement to each other. Accordingly, an attempt is made to solve intuitionistic fuzzy linear programming problems using a technique based on an earlier technique proposed by Zimmermann to solve fuzzy linear programming problem. Our proposed technique does not require the existing ranking of intuitionistic fuzzy numbers. This method is also different from the existing weight assignment method or the Angelov’s method. A comparative study is undertaken and interesting results have been presented.展开更多
Under non-random uncertainty, a new idea of finding a possibly optimal solution for linear programming problem is examined in this paper. It is an application of the intuitionistic fuzzy set concept within scope of th...Under non-random uncertainty, a new idea of finding a possibly optimal solution for linear programming problem is examined in this paper. It is an application of the intuitionistic fuzzy set concept within scope of the existing fuzzy optimization. Here, we solve a linear programming problem (LPP) in an intuitionistic fuzzy environment and compare the result with the solution obtained from other existing techniques. In the process, the result of associated fuzzy LPP is also considered for a better understanding.展开更多
A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forc...A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.展开更多
The objective of the paper is to deal with a kind of possibilistic linear programming (PLP) problem involving multiple objectives of conflicting nature. In particular, we have considered a multi objective linear progr...The objective of the paper is to deal with a kind of possibilistic linear programming (PLP) problem involving multiple objectives of conflicting nature. In particular, we have considered a multi objective linear programming (MOLP) problem whose objective is to simultaneously minimize cost and maximize profit in a supply chain where cost and profit coefficients, and related parameters such as available supply, forecast demand and budget are fuzzy with trapezoidal fuzzy numbers. An example is given to illustrate the strategy used to solve the aforesaid PLP problem.展开更多
In this paper, we study a new approach for solving linear fractional programming problem (LFP) by converting it into a single Linear Programming (LP) Problem, which can be solved by using any type of linear fractional...In this paper, we study a new approach for solving linear fractional programming problem (LFP) by converting it into a single Linear Programming (LP) Problem, which can be solved by using any type of linear fractional programming technique. In the objective function of an LFP, if βis negative, the available methods are failed to solve, while our proposed method is capable of solving such problems. In the present paper, we propose a new method and develop FORTRAN programs to solve the problem. The optimal LFP solution procedure is illustrated with numerical examples and also by a computer program. We also compare our method with other available methods for solving LFP problems. Our proposed method of linear fractional programming (LFP) problem is very simple and easy to understand and apply.展开更多
For the transportation problem, Sharma and Sharma [1] have given a very computationally efficient heuristic (runs in O(c*n2) time) to give very good dual solution to transportation problem. Sharma and Prasad [2] have ...For the transportation problem, Sharma and Sharma [1] have given a very computationally efficient heuristic (runs in O(c*n2) time) to give very good dual solution to transportation problem. Sharma and Prasad [2] have given an efficient heuristic (complexity O(n3) procedure to give a very good primal solution (that is generally non-basic feasible solution) to transportation problem by using the very good dual solution given by Sharma and Sharma [2]. In this paper we use the solution given by Sharma and Prasad [2] to get a very good Basic Feasible Solution to transportation problem, so that network simplex (worst case complexity (O(n3*(log(n))) can be used to reach the optimal solution to transportation problem. In the second part of this paper, we give a simple heuristic procedure to get a very good BFS to linear programming problem from the solution given by Karmarkar [3] (that generally produces a very good non-basic feasible solution in polynomial time (O(n5.5)). We give a procedure to obtain a good BFS for LP by starting from the solution given by Karmarkar [3]. We note that this procedure (given here) is significantly different from the procedure given in [4].展开更多
In this paper, the statistical averaging method and the new statistical averaging methods have been used to solve the fuzzy multi-objective linear programming problems. These methods have been applied to form a single...In this paper, the statistical averaging method and the new statistical averaging methods have been used to solve the fuzzy multi-objective linear programming problems. These methods have been applied to form a single objective function from the fuzzy multi-objective linear programming problems. At first, a numerical example of solving fuzzy multi-objective linear programming problem has been provided to validate the maximum risk reduction by the proposed method. The proposed method has been applied to assess the risk of damage due to natural calamities like flood, cyclone, sidor, and storms at the coastal areas in Bangladesh. The proposed method of solving the fuzzy multi-objective linear programming problems by the statistical method has been compared with the Chandra Sen’s method. The numerical results show that the proposed method maximizes the risk reduction capacity better than Chandra Sen’s method.展开更多
A technique is developed for finding a closed form expression for the cumulative distribution function of the maximum value of the objective function in a stochastic linear programming problem, where either the object...A technique is developed for finding a closed form expression for the cumulative distribution function of the maximum value of the objective function in a stochastic linear programming problem, where either the objective function coefficients or the right hand side coefficients are continuous random vectors with known probability distributions. This is the “wait and see” problem of stochastic linear programming. Explicit results for the distribution problem are extremely difficult to obtain;indeed, previous results are known only if the right hand side coefficients have an exponential distribution [1]. To date, no explicit results have been obtained for stochastic c, and no new results of any form have appeared since the 1970’s. In this paper, we obtain the first results for stochastic c, and new explicit results if b an c are stochastic vectors with an exponential, gamma, uniform, or triangle distribution. A transformation is utilized that greatly reduces computational time.展开更多
This paper is comprised of the modeling and optimization of a multi objective linear programming problem in fuzzy environment in which some goals are fractional and some are linear. Here, we present a new approach for...This paper is comprised of the modeling and optimization of a multi objective linear programming problem in fuzzy environment in which some goals are fractional and some are linear. Here, we present a new approach for its solution by using α-cut of fuzzy numbers. In this proposed method, we first define membership function for goals by introducing non-deviational variables for each of objective functions with effective use of α-cut intervals to deal with uncertain parameters being represented by fuzzy numbers. In the optimization process the under deviational variables are minimized for finding a most satisfactory solution. The developed method has also been implemented on a problem for illustration and comparison.展开更多
Selecting diets by quantitative techniques is becoming increasingly common. Linear programming is the most popular technique for the selection of least cost mixes of food to meet specific nutritional requirements for ...Selecting diets by quantitative techniques is becoming increasingly common. Linear programming is the most popular technique for the selection of least cost mixes of food to meet specific nutritional requirements for a particular group of persons for either general health or disease-related reason. Hypertension is a silent killer and its prevalence rate especially in the developing countries, which has been mostly associated to demographic, environmental and genetic factors, is becoming alarming. The DASH diet has been clinically proven to prevent and control hypertension. In this paper, a model that provides a Daily Optimal (minimum cost) DASH Diet plan for people with hypertension is formulated. The objective is to obtain daily minimum cost diet plans that satisfy the DASH Diets’ nutrients Tolerable Upper and Lower Intake for different daily Calorie Levels. The formulated DASH diet model was further illustrated using real data set with food samples gotten from the DASH eating plan chart. A DASH diet model for a hypertensive person with a 2000-daily-caloric need was formulated and its optimal diet plan for a day obtained with a total cost of 944.41 Naira. Optimal diet plans for other recommended daily calorie levels were also obtained.展开更多
A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equ...A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.展开更多
An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, ...An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, which eliminate the possibility of cycling and the solution of the problem is reached in a finite number of steps. Example to illustrate the method is also included in the paper.展开更多
Posterior constraint optimal selection techniques (COSTs) are developed for nonnegative linear programming problems (NNLPs), and a geometric interpretation is provided. The posterior approach is used in both a dynamic...Posterior constraint optimal selection techniques (COSTs) are developed for nonnegative linear programming problems (NNLPs), and a geometric interpretation is provided. The posterior approach is used in both a dynamic and non-dynamic active-set framework. The computational performance of these methods is compared with the CPLEX standard linear programming algorithms, with two most-violated constraint approaches, and with previously developed COST algorithms for large-scale problems.展开更多
There is a growing technological development in intelligent teaching systems. This field has become interesting to many researchers. In this paper, we present an intelligent tutoring system for teaching mathematics th...There is a growing technological development in intelligent teaching systems. This field has become interesting to many researchers. In this paper, we present an intelligent tutoring system for teaching mathematics that helps students understand the basics of linear programming using Linear Program Solver and Service for Solving Linear Programming Problems, through which students will be able to solve economic problems. It comes down to determining the minimum or maximum value of a linear function, which is called the objective function, according to pre-set limiting conditions expressed by linear equations and inequalities. The goal function and the limiting conditions represent a mathematical model of the observed problem. Working as a professor of mathematics in high school, I felt the need for one such work and dealing with the study of linear programming as an integral part of mathematics. There are a number of papers in this regard, but exclusively related to traditional ways of working, as stated in the introductory part of the paper. The center of work as well as the final part deals with the study of linear programming using programs that deal with this topic.展开更多
In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed li...In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinity- norm minimization problems.Numerical results are presented.展开更多
The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex q...The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex quadratic programming problem is then solved by interior point algorithms. This settles one of the open problems of whether P = NP or not. The worst case complexity of interior point algorithms for the convex quadratic problem is polynomial. It can also be shown that every liner integer problem can be converted into binary linear problem.展开更多
文摘A multi-objective linear programming problem is made from fuzzy linear programming problem. It is due the fact that it is used fuzzy programming method during the solution. The Multi objective linear programming problem can be converted into the single objective function by various methods as Chandra Sen’s method, weighted sum method, ranking function method, statistical averaging method. In this paper, Chandra Sen’s method and statistical averaging method both are used here for making single objective function from multi-objective function. Two multi-objective programming problems are solved to verify the result. One is numerical example and the other is real life example. Then the problems are solved by ordinary simplex method and fuzzy programming method. It can be seen that fuzzy programming method gives better optimal values than the ordinary simplex method.
基金supported by the Fundamental Research Funds for the Central Universities(K50511700004)the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)
文摘An integer linear bilevel programming problem is firstly transformed into a binary linear bilevel programming problem, and then converted into a single-level binary implicit programming. An orthogonal genetic algorithm is developed for solving the binary linear implicit programming problem based on the orthogonal design. The orthogonal design with the factor analysis, an experimental design method is applied to the genetic algorithm to make the algorithm more robust, statistical y sound and quickly convergent. A crossover operator formed by the orthogonal array and the factor analysis is presented. First, this crossover operator can generate a smal but representative sample of points as offspring. After al of the better genes of these offspring are selected, a best combination among these offspring is then generated. The simulation results show the effectiveness of the proposed algorithm.
文摘Intuitionistic Fuzzy Set (IFS) can be used as a general tool for modeling problems of decision making under uncertainty where, the degree of rejection is defined simultaneously with the degree of acceptance of a piece of information in such a way that these degrees are not complement to each other. Accordingly, an attempt is made to solve intuitionistic fuzzy linear programming problems using a technique based on an earlier technique proposed by Zimmermann to solve fuzzy linear programming problem. Our proposed technique does not require the existing ranking of intuitionistic fuzzy numbers. This method is also different from the existing weight assignment method or the Angelov’s method. A comparative study is undertaken and interesting results have been presented.
文摘Under non-random uncertainty, a new idea of finding a possibly optimal solution for linear programming problem is examined in this paper. It is an application of the intuitionistic fuzzy set concept within scope of the existing fuzzy optimization. Here, we solve a linear programming problem (LPP) in an intuitionistic fuzzy environment and compare the result with the solution obtained from other existing techniques. In the process, the result of associated fuzzy LPP is also considered for a better understanding.
基金Supported by the Natural Science Foundation of Henan Province(0511012000 0511013600) Supported by the Science Foundation for Pure Research of Natural Science of the Education Department of Henan Province(200512950001)
基金supported by the Natural Science Basic Research Plan in Shaanxi Province of China(2013JM1022)the Fundamental Research Funds for the Central Universities(K50511700004)
文摘A discrete differential evolution algorithm combined with the branch and bound method is developed to solve the integer linear bilevel programming problems, in which both upper level and lower level variables are forced to be integer. An integer coding for upper level variables is adopted, and then a discrete differential evolution algorithm with an improved feasibility-based comparison is developed to directly explore the integer solution at the upper level. For a given upper level integer variable, the lower level integer programming problem is solved by the existing branch and bound algorithm to obtain the optimal integer solution at the lower level. In the same framework of the algorithm, two other constraint handling methods, i.e. the penalty function method and the feasibility-based comparison method are also tested. The experimental results demonstrate that the discrete differential evolution algorithm with different constraint handling methods is effective in finding the global optimal integer solutions, but the improved constraint handling method performs better than two compared constraint handling methods.
文摘The objective of the paper is to deal with a kind of possibilistic linear programming (PLP) problem involving multiple objectives of conflicting nature. In particular, we have considered a multi objective linear programming (MOLP) problem whose objective is to simultaneously minimize cost and maximize profit in a supply chain where cost and profit coefficients, and related parameters such as available supply, forecast demand and budget are fuzzy with trapezoidal fuzzy numbers. An example is given to illustrate the strategy used to solve the aforesaid PLP problem.
文摘In this paper, we study a new approach for solving linear fractional programming problem (LFP) by converting it into a single Linear Programming (LP) Problem, which can be solved by using any type of linear fractional programming technique. In the objective function of an LFP, if βis negative, the available methods are failed to solve, while our proposed method is capable of solving such problems. In the present paper, we propose a new method and develop FORTRAN programs to solve the problem. The optimal LFP solution procedure is illustrated with numerical examples and also by a computer program. We also compare our method with other available methods for solving LFP problems. Our proposed method of linear fractional programming (LFP) problem is very simple and easy to understand and apply.
文摘For the transportation problem, Sharma and Sharma [1] have given a very computationally efficient heuristic (runs in O(c*n2) time) to give very good dual solution to transportation problem. Sharma and Prasad [2] have given an efficient heuristic (complexity O(n3) procedure to give a very good primal solution (that is generally non-basic feasible solution) to transportation problem by using the very good dual solution given by Sharma and Sharma [2]. In this paper we use the solution given by Sharma and Prasad [2] to get a very good Basic Feasible Solution to transportation problem, so that network simplex (worst case complexity (O(n3*(log(n))) can be used to reach the optimal solution to transportation problem. In the second part of this paper, we give a simple heuristic procedure to get a very good BFS to linear programming problem from the solution given by Karmarkar [3] (that generally produces a very good non-basic feasible solution in polynomial time (O(n5.5)). We give a procedure to obtain a good BFS for LP by starting from the solution given by Karmarkar [3]. We note that this procedure (given here) is significantly different from the procedure given in [4].
文摘In this paper, the statistical averaging method and the new statistical averaging methods have been used to solve the fuzzy multi-objective linear programming problems. These methods have been applied to form a single objective function from the fuzzy multi-objective linear programming problems. At first, a numerical example of solving fuzzy multi-objective linear programming problem has been provided to validate the maximum risk reduction by the proposed method. The proposed method has been applied to assess the risk of damage due to natural calamities like flood, cyclone, sidor, and storms at the coastal areas in Bangladesh. The proposed method of solving the fuzzy multi-objective linear programming problems by the statistical method has been compared with the Chandra Sen’s method. The numerical results show that the proposed method maximizes the risk reduction capacity better than Chandra Sen’s method.
文摘A technique is developed for finding a closed form expression for the cumulative distribution function of the maximum value of the objective function in a stochastic linear programming problem, where either the objective function coefficients or the right hand side coefficients are continuous random vectors with known probability distributions. This is the “wait and see” problem of stochastic linear programming. Explicit results for the distribution problem are extremely difficult to obtain;indeed, previous results are known only if the right hand side coefficients have an exponential distribution [1]. To date, no explicit results have been obtained for stochastic c, and no new results of any form have appeared since the 1970’s. In this paper, we obtain the first results for stochastic c, and new explicit results if b an c are stochastic vectors with an exponential, gamma, uniform, or triangle distribution. A transformation is utilized that greatly reduces computational time.
文摘This paper is comprised of the modeling and optimization of a multi objective linear programming problem in fuzzy environment in which some goals are fractional and some are linear. Here, we present a new approach for its solution by using α-cut of fuzzy numbers. In this proposed method, we first define membership function for goals by introducing non-deviational variables for each of objective functions with effective use of α-cut intervals to deal with uncertain parameters being represented by fuzzy numbers. In the optimization process the under deviational variables are minimized for finding a most satisfactory solution. The developed method has also been implemented on a problem for illustration and comparison.
文摘Selecting diets by quantitative techniques is becoming increasingly common. Linear programming is the most popular technique for the selection of least cost mixes of food to meet specific nutritional requirements for a particular group of persons for either general health or disease-related reason. Hypertension is a silent killer and its prevalence rate especially in the developing countries, which has been mostly associated to demographic, environmental and genetic factors, is becoming alarming. The DASH diet has been clinically proven to prevent and control hypertension. In this paper, a model that provides a Daily Optimal (minimum cost) DASH Diet plan for people with hypertension is formulated. The objective is to obtain daily minimum cost diet plans that satisfy the DASH Diets’ nutrients Tolerable Upper and Lower Intake for different daily Calorie Levels. The formulated DASH diet model was further illustrated using real data set with food samples gotten from the DASH eating plan chart. A DASH diet model for a hypertensive person with a 2000-daily-caloric need was formulated and its optimal diet plan for a day obtained with a total cost of 944.41 Naira. Optimal diet plans for other recommended daily calorie levels were also obtained.
基金supported by the National Natural Science Foundation of China(70771080)the Special Fund for Basic Scientific Research of Central Colleges+2 种基金China University of Geosciences(Wuhan) (CUG090113)the Research Foundation for Outstanding Young TeachersChina University of Geosciences(Wuhan)(CUGQNW0801)
文摘A global convergent algorithm is proposed to solve bilevel linear fractional-linear programming, which is a special class of bilevel programming. In our algorithm, replacing the lower level problem by its dual gap equaling to zero, the bilevel linear fractional-linear programming is transformed into a traditional sin- gle level programming problem, which can be transformed into a series of linear fractional programming problem. Thus, the modi- fied convex simplex method is used to solve the infinite linear fractional programming to obtain the global convergent solution of the original bilevel linear fractional-linear programming. Finally, an example demonstrates the feasibility of the proposed algorithm.
文摘An algorithm is proposed in this paper for solving two-dimensional bi-level linear programming problems without making a graph. Based on the classification of constraints, algorithm removes all redundant constraints, which eliminate the possibility of cycling and the solution of the problem is reached in a finite number of steps. Example to illustrate the method is also included in the paper.
文摘Posterior constraint optimal selection techniques (COSTs) are developed for nonnegative linear programming problems (NNLPs), and a geometric interpretation is provided. The posterior approach is used in both a dynamic and non-dynamic active-set framework. The computational performance of these methods is compared with the CPLEX standard linear programming algorithms, with two most-violated constraint approaches, and with previously developed COST algorithms for large-scale problems.
文摘There is a growing technological development in intelligent teaching systems. This field has become interesting to many researchers. In this paper, we present an intelligent tutoring system for teaching mathematics that helps students understand the basics of linear programming using Linear Program Solver and Service for Solving Linear Programming Problems, through which students will be able to solve economic problems. It comes down to determining the minimum or maximum value of a linear function, which is called the objective function, according to pre-set limiting conditions expressed by linear equations and inequalities. The goal function and the limiting conditions represent a mathematical model of the observed problem. Working as a professor of mathematics in high school, I felt the need for one such work and dealing with the study of linear programming as an integral part of mathematics. There are a number of papers in this regard, but exclusively related to traditional ways of working, as stated in the introductory part of the paper. The center of work as well as the final part deals with the study of linear programming using programs that deal with this topic.
文摘In this paper,we consider nonlinear infinity-norm minimization problems.We device a reliable Lagrangian dual approach for solving this kind of problems and based on this method we propose an algorithm for the mixed linear and nonlinear infinity- norm minimization problems.Numerical results are presented.
文摘The paper presents a technique for solving the binary linear programming model in polynomial time. The general binary linear programming problem is transformed into a convex quadratic programming problem. The convex quadratic programming problem is then solved by interior point algorithms. This settles one of the open problems of whether P = NP or not. The worst case complexity of interior point algorithms for the convex quadratic problem is polynomial. It can also be shown that every liner integer problem can be converted into binary linear problem.