Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
1,965
Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions
- SIAM Journal of Optimization
, 1998
"... Abstract. The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder–Mead algorithm. This paper pr ..."
Abstract
-
Cited by 598 (3 self)
- Add to MetaCart
Abstract. The Nelder–Mead simplex algorithm, first published in 1965, is an enormously popular direct search method for multidimensional unconstrained minimization. Despite its widespread use, essentially no theoretical results have been proved explicitly for the Nelder–Mead algorithm. This paper
A regularized simplex method
"... Abstract In case of a special problem class, the simplex method can be implemented as a cutting-plane method that approximates a polyhedral convex objective function. In this paper we consider a regularized version of this cutting-plane method, and interpret the resulting procedure as a regularized ..."
Abstract
- Add to MetaCart
Abstract In case of a special problem class, the simplex method can be implemented as a cutting-plane method that approximates a polyhedral convex objective function. In this paper we consider a regularized version of this cutting-plane method, and interpret the resulting procedure as a
Intuitionistic Fuzzy Simplex Method
, 2012
"... This paper deals with Intuitionistic Fuzzy Linear Programming Problems(IFLPPs) using Symmetric Trapezoidal Intuitionistic Fuzzy Numbers(STIFNs) and the arithmetic operations defined on them. A special ranking function is presented in project environment to rank STIFN. An attempt has been made to sol ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
to solve the given IFLPP without converting them to crisp linear programming problems by using intuitionistic fuzzy simplex method and the algorithm is effective and reasonable as is evident from the results of a numerical example.
Khot: Simplex Method: An Alternative Approach
- International Journal of Engineering and Innovative Technology, Volume 3, Issue
, 2013
"... Abstract-In this paper, an alternative approach to the Simplex method of solution of linear programming is suggested. The method sometimes involves less iteration than in the Simplex method or at the most equal number. This powerful technique is illustrated through the problems. ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Abstract-In this paper, an alternative approach to the Simplex method of solution of linear programming is suggested. The method sometimes involves less iteration than in the Simplex method or at the most equal number. This powerful technique is illustrated through the problems.
An Example of Cycling in the Simplex Method
"... Ho man[3] gave the rst example of cycling in the simplex method, which had 11 variables and 3 equations. A few years later Beale[1] gave one with only 7 variables and 3 equations, which is given below. (Both are described by Dantzig[2].) 1 x1 x2 x3 x4 x5 x6 x7 RHS [1=4],60,1=25 9 1 0 1=2,90,1=50 3 1 ..."
Abstract
- Add to MetaCart
Ho man[3] gave the rst example of cycling in the simplex method, which had 11 variables and 3 equations. A few years later Beale[1] gave one with only 7 variables and 3 equations, which is given below. (Both are described by Dantzig[2].) 1 x1 x2 x3 x4 x5 x6 x7 RHS [1=4],60,1=25 9 1 0 1=2,90,1=50 3
Linear programming and the simplex method
- Notices of the AMS, 54(3):364–369`. George Spanoudakis, Christos Kloukinas, Khaled Mahbub
, 2007
"... This exposition of linear programming and the simplex method is intended as a companion piece to the article in this issue on the life and work of George B. Dantzig in which the impact and significance of this particular achievement are described. It is now nearly sixty years since Dantzig’s origina ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
This exposition of linear programming and the simplex method is intended as a companion piece to the article in this issue on the life and work of George B. Dantzig in which the impact and significance of this particular achievement are described. It is now nearly sixty years since Dantzig’s
Refined Simplex Method for Data Fitting
"... Abstract. The simplex method, a data fitting method to any type of function, is refined by eliminating a redundant process. The refined method is applied to Zernike polynomials in Cartesian coordinates, which describe an optical surface or wavefront in terms of aberrations. The advantages and disadv ..."
Abstract
- Add to MetaCart
Abstract. The simplex method, a data fitting method to any type of function, is refined by eliminating a redundant process. The refined method is applied to Zernike polynomials in Cartesian coordinates, which describe an optical surface or wavefront in terms of aberrations. The advantages
Refined Simplex Method for Data Fitting
, 1997
"... The simplex method, a data fitting method to any type of function, is refined by eliminating a redundant process. The refined method is applied to Zernike polynomials in Cartesian coordinates, which describe an optical surface or wavefront in terms of aberrations. The advantages and disadvantages of ..."
Abstract
- Add to MetaCart
The simplex method, a data fitting method to any type of function, is refined by eliminating a redundant process. The refined method is applied to Zernike polynomials in Cartesian coordinates, which describe an optical surface or wavefront in terms of aberrations. The advantages and disadvantages
Results 1 - 10
of
1,965
