The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcom...The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcome the result mesh-sensitivity problem in the dynamic strain softening or strain localization analysis. The equations for the dynamic elastic-plastic problems are derived in terms of the parametric variational principle, which is valid for associated, non-associated and strain softening plastic constitutive models in the finite element analysis. The precise integration method, which has been widely used for discretization in time domain of the linear problems, is introduced for the solution of dynamic nonlinear equations. The new algorithm proposed is based on the combination of the parametric quadratic programming method and the precise integration method and has all the advantages in both of the algorithms. Results of numerical examples demonstrate not only the validity, but also the advantages of the algorithm proposed for the numerical solution of nonlinear dynamic problems.展开更多
In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem....In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.展开更多
For the gray attributes of the equipment program and its difficulty to carry out the quantitative assessment of the equipment program information, the gray relation projection method is simply reviewed. Combining the ...For the gray attributes of the equipment program and its difficulty to carry out the quantitative assessment of the equipment program information, the gray relation projection method is simply reviewed. Combining the super-data envelopment analysis（DEA） model and the gray system theory, a new super-DEA for measuring the weight is proposed, and a gray relation projection model is established to rank the equipment programs. Finally, this approach is used to evaluate the equipment program. The results are verified valid and can provide a new way for evaluating the equipment program.展开更多
BACKGROUND: In the natural evolution of cerebrovascular disease, unconscious use of affected extremity during drug treatment and daily life can improve the function of affected upper extremity partially, but it is ver...BACKGROUND: In the natural evolution of cerebrovascular disease, unconscious use of affected extremity during drug treatment and daily life can improve the function of affected upper extremity partially, but it is very slow and also accompanied by the formation of abnormal mode. Therefore, functional training should be emphasized in recovering the motor function of extremity. OBJECTIVE: To observe the effects of combination of motor relearning program and Bobath method on motor function of upper extremity of patients with stroke. DESIGN: Comparison of therapeutic effects taking stroke patients as observation subjects. SETTING: Department of Neurology, General Hospital of Beijing Jingmei Group. PARTICIPANTS: Totally 120 stroke patients, including 60 males and 60 females, averaged (59±3) years, who hospitalized in the Department of Neurology, General Hospital of Beijing Jingmei Group between January 2005 and June 2006 were recruited. The involved patients met the following criteria: Stroke attack within 2 weeks; diagnosis criteria of cerebral hemorrhage or infarction made in the 4th National Cerebrovascular Disease Conference; confirmed by skull CT or MRI; Informed consents of therapeutic regimen were obtained. The patients were assigned into 2 groups according to their wills: rehabilitation group and control group, with 30 males and 30 females in each group. Patients in rehabilitation group averaged (59±2)years old, and those in the control group averaged (58±2)years old. METHODS: ① Patients in two groups received routine treatment in the Department of Neurology. When the vital signs of patients in the rehabilitation group were stable, individualized treatment was conducted by combined application of motor relearning program and Bobath method. Meanwhile, training of activity of daily living was performed according to the disease condition changes of patients at different phases, including the nursing and instruction of body posture, the maintenance of good extremity position, bed exercise, bedside sit up and sitting position balance, sit up exercise, dynamic and static balance exercise, walking exercise, active training and passive training. The strength, time and speed of training were increased gradually according to their physical abilities. Patients were trained 45 to 60 minutes once, 5 times a week, within 2 weeks. ② Evaluation criteria of therapeutic effect: The motor function of upper extremity was evaluated by Fugl-Meyer method on the day of beginning and end of treatment. Higher points indicated better function of upper extremity. ③ t test and paired t test were used for comparing the difference of intergroup and intragroup measurement data, respectively. MAIN OUTCOME MEASURES: Changes in Fugl-Meyer scoring of two groups before and after treatment. RESULTS: Totally 120 stroke patients participated in the final analysis. Before treatment, Fugl-Meyer scoring was close between rehabilitation group and control group [(14.47±2.38),(14.16±2.39) points, P > 0.05]; Fugl-Meyer scoring of rehabilitation group after treatment was significantly higher than that before treatment and that of control group[(37.93±2.67),(18.36±2.43) points, t =11.053, 5.408, P < 0.01]; There were no significant differences in Fugl-Meyer scoring between before treatment in the control group and control group (P > 0.05). CONCLUSION: Combined application of motor relearning program and Bobath method can significantly improve the motor function of upper extremity of patients with stroke.展开更多
In this paper, we propose an interactive method for solving the multilevel linear programming problems based on the intuitionistic fuzzy set theory. Firstly, the membership function and the non-membership function are...In this paper, we propose an interactive method for solving the multilevel linear programming problems based on the intuitionistic fuzzy set theory. Firstly, the membership function and the non-membership function are introduced to describe the uncertainty of the decision makers. Secondly, a satisfactory solution is derived by updating the minimum satisfactory degrees with considerations of the overall satisfactory balance among all levels. In addition, the steps of the proposed method are given in this paper. Finally, numerical examples illustrate the feasibility of this method.展开更多
In this study, we developed a computer program for automatic prediction of watering time point by considering the environmental factors such as solar radiation, air temperature and relative humidity based on the multi...In this study, we developed a computer program for automatic prediction of watering time point by considering the environmental factors such as solar radiation, air temperature and relative humidity based on the multiple linear regression equation of leaf area and Penman Method. The experiments were carried out for a year in two watering experimental plots, one of which was controlled by pF value, and the other by the computer program. After comparing the results of the two plots, the following findings were obtained. In the computer program plot, the observed and predicted values of both leaf area and evapotranspiration indicated significant correlation at the 1% level, which suggested that the computer program had high prediction accuracy. In addition, no significant difference was observed between the two experimental plots with respects to the plant height, plant diameter, leaf area, leaf number, fresh weight, and dry weight, which demonstrated that the plants in the computer program plot had normal growth. On the other hand, although the number of flower buds and flowering shoots showed higher values at the end of certain cultivations in the computer program plot than those in pF value plot, we proposed that it was due to the effect of cumulative daily solar radiation in the greenhouse, rather than the watering. Thus, we have reached the conclusion that the computer program for automatic prediction of watering time point developed by this study has high applicability in miniature pot rose production.展开更多
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.展开更多
We present a new variant of penalty method, which is different from the existing penalty methods, for solving the weak linear bilevel programming problems. We then transform it into a single-level optimization problem...We present a new variant of penalty method, which is different from the existing penalty methods, for solving the weak linear bilevel programming problems. We then transform it into a single-level optimization problem using Kuhn-Tucker optimality condition and discuss the relations between them. Finally, two examples are used to illustrate the feasibility of the proposed penalty method.展开更多
A novel slow-down set waveform is proposed to improve the set performance and a 1 kb phase change random access memory chip fabricated with a 13nm CMOS technology is implemented to investigate the set performance by d...A novel slow-down set waveform is proposed to improve the set performance and a 1 kb phase change random access memory chip fabricated with a 13nm CMOS technology is implemented to investigate the set performance by different set programming strategies based on this new set pulse. The amplitude difference （I1 - I2） of the set pulse is proved to be a crucial parameter for set programming. We observe and analyze the cell characteristics with different I1 - I2 by means of thermal simulations and high-resolution transmission electron microscopy, which reveal that an incomplete set programming will occur when the proposed slow-down pulse is set with an improperly high I1 - I2. This will lead to an amorphous residue in the active region. We also discuss the programming method to avoid the set performance degradations.展开更多
A new algorithm for the solution of quadratic programming problemsis put forward in terms of the mixed energy theory and is furtherused for the incremental solution of elastic-plastic trussstructures. The method propo...A new algorithm for the solution of quadratic programming problemsis put forward in terms of the mixed energy theory and is furtherused for the incremental solution of elastic-plastic trussstructures. The method proposed is different from the traditionalone, for which the unknown variables are selected just in one classsuch as displacements or stresses. The present method selects thevariables in the mixed form with both displacement and stress. As themethod is established in the hybrid space, the information found inthe previous incremental step can be used for the solution of thepresent step, making the algorithm highly effi- cient in thenumerical solution process of quadratic programming problems. Theresults obtained in the exm- ples of the elastic-plastic solution ofthe truss structures verify what has been predicted in thetheoretical anal- ysis.展开更多
In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex n...In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.展开更多
An algorithm for solving a class of smooth convex programming is given. Using smooth exact multiplier penalty function, a smooth convex programming is minimized to a minimizing strongly convex function on the compact ...An algorithm for solving a class of smooth convex programming is given. Using smooth exact multiplier penalty function, a smooth convex programming is minimized to a minimizing strongly convex function on the compact set was reduced. Then the strongly convex function with a Newton method on the given compact set was minimized.展开更多
We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear p...We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear programming problem with a discrete random variable sequence, which is obtained by some discrete method. We construct an exact penalty function and obtain an unconstrained optimization. It avoids the difficulty in solution by the rapid growing of the number of constraints for discrete precision. Under lenient conditions, we prove the equivalence of the minimum solution of penalty function and the solution of the determinate programming, and prove that the solution sequences of the discrete problem converge to a solution to the original 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 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.展开更多
A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the ...A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the criteria are considered. Similarly, the total inconsistency between their final rankings for the group and the ones under every criteria is determined after the criteria weights are taken into account. Then two nonlinear integer programming models minimizing respectively the two total inconsistencies above are developed and then transformed to two dynamic programming models to obtain separately the rankings of all alternatives for the group with respect to each criteria and their final rankings. A supplier selection case illustrated the proposed method, and some discussions on the results verified its effectiveness. This work develops a new measurement of ordinal preferences’ inconsistency in multi-criteria group decision-making （MCGDM） and extends the cook-seiford social selection function to MCGDM considering weights of criteria and decision makers and can obtain unique ranking result.展开更多
This paper considers multiobjective integer programming problems involving random variables in constraints. Using the concept of simple recourse, the formulated multiobjective stochastic simple recourse problems are t...This paper considers multiobjective integer programming problems involving random variables in constraints. Using the concept of simple recourse, the formulated multiobjective stochastic simple recourse problems are transformed into deterministic ones. For solving transformed deterministic problems efficiently, we also introduce genetic algorithms with double strings for nonlinear integer programming problems. Taking into account vagueness of judgments of the decision maker, an interactive fuzzy satisficing method is presented. In the proposed interactive method, after determineing the fuzzy goals of the decision maker, a satisficing solution for the decision maker is derived efficiently by updating the reference membership levels of the decision maker. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.展开更多
A new variant of the Adaptive Method (AM) of Gabasov is presented, to minimize the computation time. Unlike the original method and its some variants, we need not to compute the inverse of the basic matrix at each ite...A new variant of the Adaptive Method (AM) of Gabasov is presented, to minimize the computation time. Unlike the original method and its some variants, we need not to compute the inverse of the basic matrix at each iteration, or to solve the linear systems with the basic matrix. In fact, to compute the new support feasible solution, the simplex pivoting rule is used by introducing a matrix that we will define. This variant is called “the Pivot Adaptive Method” (PAM);it allows presenting the resolution of a given problem under the shape of successive tables as we will see in example. The proofs that are not given by Gabasov will also be presented here, namely the proofs for the theorem of the optimality criterion and for the theorem of existence of an optimal support, and at the end, a brief comparison between our method and the Simplex Method will be given.展开更多
In this paper we discuss about infeasibility diagnosis and infeasibility resolution, when the constraint method is used for solving multi objective linear programming problems. We propose an algorithm for resolution o...In this paper we discuss about infeasibility diagnosis and infeasibility resolution, when the constraint method is used for solving multi objective linear programming problems. We propose an algorithm for resolution of infeasibility, which is a combination of interactive, weighting and constraint methods.Numerical examples are provided to illustrate the techniques developed.展开更多
In this paper, we prove that the combined homotopy interior point method for a multiobjective programming problem introduced in Ref. [1] remains valid under a weaker constrained qualification—the Mangasarian-Fromovit...In this paper, we prove that the combined homotopy interior point method for a multiobjective programming problem introduced in Ref. [1] remains valid under a weaker constrained qualification—the Mangasarian-Fromovitz constrained qualification, instead of linear independence constraint qualification. The algorithm generated by this method associated to the Karush-Kuhn-Tucker points of the multiobjective programming problem is proved to be globally convergent.展开更多
文摘The objective of the paper is to develop a new algorithm for numerical solution of dynamic elastic-plastic strain hardening/softening problems. The gradient dependent model is adopted in the numerical model to overcome the result mesh-sensitivity problem in the dynamic strain softening or strain localization analysis. The equations for the dynamic elastic-plastic problems are derived in terms of the parametric variational principle, which is valid for associated, non-associated and strain softening plastic constitutive models in the finite element analysis. The precise integration method, which has been widely used for discretization in time domain of the linear problems, is introduced for the solution of dynamic nonlinear equations. The new algorithm proposed is based on the combination of the parametric quadratic programming method and the precise integration method and has all the advantages in both of the algorithms. Results of numerical examples demonstrate not only the validity, but also the advantages of the algorithm proposed for the numerical solution of nonlinear dynamic problems.
文摘In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.
基金supported by the National Natural Science Foundation of China(7107307971222106+2 种基金70901069)the Research Foundation of the National Excellent Doctoral Dissertation of Chinathe Research Fund for the Doctoral Program of Higher Education(20133402110028)
文摘For the gray attributes of the equipment program and its difficulty to carry out the quantitative assessment of the equipment program information, the gray relation projection method is simply reviewed. Combining the super-data envelopment analysis（DEA） model and the gray system theory, a new super-DEA for measuring the weight is proposed, and a gray relation projection model is established to rank the equipment programs. Finally, this approach is used to evaluate the equipment program. The results are verified valid and can provide a new way for evaluating the equipment program.
文摘BACKGROUND: In the natural evolution of cerebrovascular disease, unconscious use of affected extremity during drug treatment and daily life can improve the function of affected upper extremity partially, but it is very slow and also accompanied by the formation of abnormal mode. Therefore, functional training should be emphasized in recovering the motor function of extremity. OBJECTIVE: To observe the effects of combination of motor relearning program and Bobath method on motor function of upper extremity of patients with stroke. DESIGN: Comparison of therapeutic effects taking stroke patients as observation subjects. SETTING: Department of Neurology, General Hospital of Beijing Jingmei Group. PARTICIPANTS: Totally 120 stroke patients, including 60 males and 60 females, averaged (59±3) years, who hospitalized in the Department of Neurology, General Hospital of Beijing Jingmei Group between January 2005 and June 2006 were recruited. The involved patients met the following criteria: Stroke attack within 2 weeks; diagnosis criteria of cerebral hemorrhage or infarction made in the 4th National Cerebrovascular Disease Conference; confirmed by skull CT or MRI; Informed consents of therapeutic regimen were obtained. The patients were assigned into 2 groups according to their wills: rehabilitation group and control group, with 30 males and 30 females in each group. Patients in rehabilitation group averaged (59±2)years old, and those in the control group averaged (58±2)years old. METHODS: ① Patients in two groups received routine treatment in the Department of Neurology. When the vital signs of patients in the rehabilitation group were stable, individualized treatment was conducted by combined application of motor relearning program and Bobath method. Meanwhile, training of activity of daily living was performed according to the disease condition changes of patients at different phases, including the nursing and instruction of body posture, the maintenance of good extremity position, bed exercise, bedside sit up and sitting position balance, sit up exercise, dynamic and static balance exercise, walking exercise, active training and passive training. The strength, time and speed of training were increased gradually according to their physical abilities. Patients were trained 45 to 60 minutes once, 5 times a week, within 2 weeks. ② Evaluation criteria of therapeutic effect: The motor function of upper extremity was evaluated by Fugl-Meyer method on the day of beginning and end of treatment. Higher points indicated better function of upper extremity. ③ t test and paired t test were used for comparing the difference of intergroup and intragroup measurement data, respectively. MAIN OUTCOME MEASURES: Changes in Fugl-Meyer scoring of two groups before and after treatment. RESULTS: Totally 120 stroke patients participated in the final analysis. Before treatment, Fugl-Meyer scoring was close between rehabilitation group and control group [(14.47±2.38),(14.16±2.39) points, P > 0.05]; Fugl-Meyer scoring of rehabilitation group after treatment was significantly higher than that before treatment and that of control group[(37.93±2.67),(18.36±2.43) points, t =11.053, 5.408, P < 0.01]; There were no significant differences in Fugl-Meyer scoring between before treatment in the control group and control group (P > 0.05). CONCLUSION: Combined application of motor relearning program and Bobath method can significantly improve the motor function of upper extremity of patients with stroke.
基金Supported by the National Natural Science Foundation of China(71471140,71171150,71103135)
文摘In this paper, we propose an interactive method for solving the multilevel linear programming problems based on the intuitionistic fuzzy set theory. Firstly, the membership function and the non-membership function are introduced to describe the uncertainty of the decision makers. Secondly, a satisfactory solution is derived by updating the minimum satisfactory degrees with considerations of the overall satisfactory balance among all levels. In addition, the steps of the proposed method are given in this paper. Finally, numerical examples illustrate the feasibility of this method.
基金supported by the Science Founda-tion of Guangxi Zhuang Autonomous Region, China(0832002)
文摘In this study, we developed a computer program for automatic prediction of watering time point by considering the environmental factors such as solar radiation, air temperature and relative humidity based on the multiple linear regression equation of leaf area and Penman Method. The experiments were carried out for a year in two watering experimental plots, one of which was controlled by pF value, and the other by the computer program. After comparing the results of the two plots, the following findings were obtained. In the computer program plot, the observed and predicted values of both leaf area and evapotranspiration indicated significant correlation at the 1% level, which suggested that the computer program had high prediction accuracy. In addition, no significant difference was observed between the two experimental plots with respects to the plant height, plant diameter, leaf area, leaf number, fresh weight, and dry weight, which demonstrated that the plants in the computer program plot had normal growth. On the other hand, although the number of flower buds and flowering shoots showed higher values at the end of certain cultivations in the computer program plot than those in pF value plot, we proposed that it was due to the effect of cumulative daily solar radiation in the greenhouse, rather than the watering. Thus, we have reached the conclusion that the computer program for automatic prediction of watering time point developed by this study has high applicability in miniature pot rose production.
基金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.
基金Supported by the National Natural Science Foundation of China(11501233)the Key Project of Anhui Province University Excellent Youth Support Plan(gxyqZD2016102)
文摘We present a new variant of penalty method, which is different from the existing penalty methods, for solving the weak linear bilevel programming problems. We then transform it into a single-level optimization problem using Kuhn-Tucker optimality condition and discuss the relations between them. Finally, two examples are used to illustrate the feasibility of the proposed penalty method.
基金Supported by the Strategic Priority Research Program of Chinese Academy of Sciences under Grant No XDA09020402the National Key Basic Research Program of China under Grant Nos 2013CBA01900,2010CB934300,2011CBA00607,and 2011CB932804+2 种基金the National Integrate Circuit Research Program of China under Grant No 2009ZX02023-003the National Natural Science Foundation of China under Grant Nos 61176122,61106001,61261160500,and 61376006the Science and Technology Council of Shanghai under Grant Nos 12nm0503701,13DZ2295700,12QA1403900,and 13ZR1447200
文摘A novel slow-down set waveform is proposed to improve the set performance and a 1 kb phase change random access memory chip fabricated with a 13nm CMOS technology is implemented to investigate the set performance by different set programming strategies based on this new set pulse. The amplitude difference （I1 - I2） of the set pulse is proved to be a crucial parameter for set programming. We observe and analyze the cell characteristics with different I1 - I2 by means of thermal simulations and high-resolution transmission electron microscopy, which reveal that an incomplete set programming will occur when the proposed slow-down pulse is set with an improperly high I1 - I2. This will lead to an amorphous residue in the active region. We also discuss the programming method to avoid the set performance degradations.
基金the National Natural Science Foundation of China(No.50178916,No.19732020 and No.19872016)the National Key Basic lteseareh Special Foundation(No.G1999032805)+1 种基金the Special Funds for Major State Basic Researeh Projectsthe Foundation for University Key Teachers by the Ministry of Education of China
文摘A new algorithm for the solution of quadratic programming problemsis put forward in terms of the mixed energy theory and is furtherused for the incremental solution of elastic-plastic trussstructures. The method proposed is different from the traditionalone, for which the unknown variables are selected just in one classsuch as displacements or stresses. The present method selects thevariables in the mixed form with both displacement and stress. As themethod is established in the hybrid space, the information found inthe previous incremental step can be used for the solution of thepresent step, making the algorithm highly effi- cient in thenumerical solution process of quadratic programming problems. Theresults obtained in the exm- ples of the elastic-plastic solution ofthe truss structures verify what has been predicted in thetheoretical anal- ysis.
文摘In this paper, on the basis of the logarithmic barrier function and KKT conditions, we propose a combined homotopy infeasible interior-point method （CHIIP） for convex nonlinear programming problems. For any convex nonlinear programming, without strict convexity for the logarithmic barrier function, we get different solutions of the convex programming in different cases by CHIIP method.
文摘An algorithm for solving a class of smooth convex programming is given. Using smooth exact multiplier penalty function, a smooth convex programming is minimized to a minimizing strongly convex function on the compact set was reduced. Then the strongly convex function with a Newton method on the given compact set was minimized.
文摘We present an approximation-exact penalty function method for solving the single stage stochastic programming problem with continuous random variable. The original problem is transformed into a determinate nonlinear programming problem with a discrete random variable sequence, which is obtained by some discrete method. We construct an exact penalty function and obtain an unconstrained optimization. It avoids the difficulty in solution by the rapid growing of the number of constraints for discrete precision. Under lenient conditions, we prove the equivalence of the minimum solution of penalty function and the solution of the determinate programming, and prove that the solution sequences of the discrete problem converge to a solution to the original 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 National Natural Science Foundation of China (60904059 60975049)+1 种基金the Philosophy and Social Science Foundation of Hunan Province (2010YBA104)the National High Technology Research and Development Program of China (863 Program)(2009AA04Z107)
文摘A method of minimizing rankings inconsistency is proposed for a decision-making problem with rankings of alternatives given by multiple decision makers according to multiple criteria. For each criteria, at first, the total inconsistency between the rankings of all alternatives for the group and the ones for every decision maker is defined after the decision maker weights in respect to the criteria are considered. Similarly, the total inconsistency between their final rankings for the group and the ones under every criteria is determined after the criteria weights are taken into account. Then two nonlinear integer programming models minimizing respectively the two total inconsistencies above are developed and then transformed to two dynamic programming models to obtain separately the rankings of all alternatives for the group with respect to each criteria and their final rankings. A supplier selection case illustrated the proposed method, and some discussions on the results verified its effectiveness. This work develops a new measurement of ordinal preferences’ inconsistency in multi-criteria group decision-making （MCGDM） and extends the cook-seiford social selection function to MCGDM considering weights of criteria and decision makers and can obtain unique ranking result.
文摘This paper considers multiobjective integer programming problems involving random variables in constraints. Using the concept of simple recourse, the formulated multiobjective stochastic simple recourse problems are transformed into deterministic ones. For solving transformed deterministic problems efficiently, we also introduce genetic algorithms with double strings for nonlinear integer programming problems. Taking into account vagueness of judgments of the decision maker, an interactive fuzzy satisficing method is presented. In the proposed interactive method, after determineing the fuzzy goals of the decision maker, a satisficing solution for the decision maker is derived efficiently by updating the reference membership levels of the decision maker. An illustrative numerical example is provided to demonstrate the feasibility and efficiency of the proposed method.
文摘A new variant of the Adaptive Method (AM) of Gabasov is presented, to minimize the computation time. Unlike the original method and its some variants, we need not to compute the inverse of the basic matrix at each iteration, or to solve the linear systems with the basic matrix. In fact, to compute the new support feasible solution, the simplex pivoting rule is used by introducing a matrix that we will define. This variant is called “the Pivot Adaptive Method” (PAM);it allows presenting the resolution of a given problem under the shape of successive tables as we will see in example. The proofs that are not given by Gabasov will also be presented here, namely the proofs for the theorem of the optimality criterion and for the theorem of existence of an optimal support, and at the end, a brief comparison between our method and the Simplex Method will be given.
文摘In this paper we discuss about infeasibility diagnosis and infeasibility resolution, when the constraint method is used for solving multi objective linear programming problems. We propose an algorithm for resolution of infeasibility, which is a combination of interactive, weighting and constraint methods.Numerical examples are provided to illustrate the techniques developed.
文摘In this paper, we prove that the combined homotopy interior point method for a multiobjective programming problem introduced in Ref. [1] remains valid under a weaker constrained qualification—the Mangasarian-Fromovitz constrained qualification, instead of linear independence constraint qualification. The algorithm generated by this method associated to the Karush-Kuhn-Tucker points of the multiobjective programming problem is proved to be globally convergent.
