The (Dantzig) simplex method for linear programming

نویسنده

  • John C. Nash
چکیده

G eorge Dantzig, in describing the " Origins of the Simplex Method, " 1 noted that it was the availability of early digital computers that supported and invited the development of LP models to solve real-world problems. He agreed that invention is sometimes the mother of necessity. Moreover, he commented that he initially rejected the simplex method because it seemed intuitively more attractive to pursue the objective function downhill—as in the currently popular interior-point methods—rather than search along the constraint set's edges. It is this latter approach that the simplex method uses, which should not be confused with the J.A. Nelder and R. Mead's function-minimization method, 2 also associated with the word simplex. When Dantzig introduced his method in 1947, it was somewhat easier to sort out the details of the simplex method than to deal with the " where are we in the domain space " questions that are, in my opinion, the core of interior-point approaches. Easier does not mean simpler, however. Chapter and verse The LP problem is, in one of the simplex method's many forms, Minimize (with respect to x) c′ x (1a) subject to A x = b (1b) and x ≥ 0 (1c) This is not always the problem we want to solve, though—we might want to have the matrix A and vector b partitioned row-wise so that (A1) (b1) A = (A2) b = (b2) (A3) (b3) so that we can write an LP problem as George Dantzig created a simplex algorithm to solve linear programs for planning and decision-making in large-scale enterprises. The algorithm's success led to a vast array of specializations and generalizations that have dominated practical operations research for half a century.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The modern study of optimization began with the introduction of the famous simplex method for linear programming by George Dantzig in 1947. Its growth

The modern study of optimization began with the introduction of the famous simplex method for linear programming by George Dantzig in 1947. Its growth since then has been remarkable: extensions to integer and combinatorial optimization, to quadratic programming and linear complementarity problems, to stochastic programming, and to conic, convex, and more general nonlinear optimization. Even mor...

متن کامل

Some new results on semi fully fuzzy linear programming problems

There are two interesting methods, in the literature, for solving fuzzy linear programming problems in which the elements of coefficient matrix of the constraints are represented by real numbers and rest of the parameters are represented by symmetric trapezoidal fuzzy numbers. The first method, named as fuzzy primal simplex method, assumes an initial primal basic feasible solution is at hand. T...

متن کامل

Pivot Rules for the Simplex Method

Pivot selection, the choice of entering variable, is a crucial step in the Simplex method. Good choices can lead to a significant speedup in finding a solution to a linear program, while poor choices lead to very slow or even nonterminal progress. This report explores three widely used pivot heuristics: the Dantzig rule, Steepest-Edge, and Devex. The theoretical underpinnings of each are studie...

متن کامل

The Simplex Method is Strongly Polynomial for the Markov Decision Problem with a Fixed Discount Rate

In this short paper we prove that the classic simplex method with the mostnegative-reduced-cost pivoting rule (Dantzig 1947) for solving the Markov decision problem (MDP) with a fixed discount rate is a strongly polynomial-time algorithm. The result seems surprising since this very pivoting rule was shown to be exponential for solving a general linear programming (LP) problem, and the simplex (...

متن کامل

A new approach to fuzzy quantities ordering based on distance method and its applications for solving fuzzy linear programming

Many ranking methods have been proposed so far. However, there is yet no method that can always give a satisfactory solution to every situation; some are counterintuitive, not discriminating; some use only the local information of fuzzy values; some produce different ranking for the same situation. For overcoming the above problems, we propose a new method for ranking fuzzy quantities based on ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computing in Science and Engineering

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2000