scientific article; zbMATH DE number 3069632
From MaRDI portal
Publication:5808752
zbMATH Open0045.09802MaRDI QIDQ5808752FDOQ5808752
Authors: George Dantzig 
Publication date: 1951
Title of this publication is not available (Why is that?)
Cited In (59)
- The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
- Pairwise comparisons or constrained optimization? A usability evaluation of techniques for eliciting decision priorities
- Algorithms
- Eine Methode der Produktionsplanung
- The polytope of optimal approximate designs: extending the selection of informative experiments
- Short proofs of ideal membership
- A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation
- The double pivot simplex method
- Three circle theorems in partial differential equations and applications to improperly posed problems
- A Friendly Smoothed Analysis of the Simplex Method
- Optimization of sparsity-constrained neural networks as a mixed integer linear program
- An exploratory computational analysis of dual degeneracy in mixed-integer programming
- Bestimmung einer ersten Basislösung beim „Linearen Programmieren“
- Combinatorial Optimization: The Interplay of Graph Theory, Linear and Integer Programming Illustrated on Network Flow
- Parametric linear programming and anti-cycling pivoting rules
- A projective simplex algorithm using LU decomposition
- Bruno de Finetti and the case of the critical line's last segment
- Men and progress in linear programming
- POINTWISE RESIDUAL METHOD FOR SOLVING PRIMAL AND DUAL ILL-POSED LINEAR PROGRAMMING PROBLEMS WITH APPROXIMATE DATA
- A guide to conic optimisation and its applications
- Experiments with external pivoting
- Evaluating the impact of AND/OR search on 0-1 integer linear programming
- Message-recovery laser fault injection attack on the \textit{classic McEliece} cryptosystem
- A variant of the dual face algorithm using Gauss-Jordan elimination for linear programming
- Eigenvalue spread criteria in the particle swarm optimization algorithm for solving of constraint parametric problems
- A two-phase support method for solving linear programs: numerical experiments
- A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
- Implementing the simplex method as a cutting-plane method, with a view to regularization
- Optimality conditions for maximizing a function over a polyhedron
- A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
- Algebraic simplex initialization combined with the nonfeasible basis method
- Finding a maximal element of a non-negative convex set through its characteristic cone: an application to finding a strictly complementary solution
- A counterexample to the Hirsch conjecture
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and \(O(n^ 2m)\) time
- A polynomial projection-type algorithm for linear programming
- An overview on the simplex algorithm
- Facility location-allocation problem in random fuzzy environment: using \((\alpha,\beta )\)-cost minimization model under the Hurewicz criterion
- The average number of pivot steps of the simplex-algorithm based on a generalized rotation-symmetry-model
- On ``pre-historic linear programming and the figure of the Earth
- A linear programming primer: from Fourier to Karmarkar
- Geometric random edge
- Solving combinatorial optimization problems using Karmarkar's algorithm
- ON MARINE LIABILITY PORTFOLIO MODELING
- A linear scheme satisfying a maximum principle for anisotropic diffusion operators on distorted grids
- Edge-directions of standard polyhedra with applications to network flows
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- Substitution with Satiation: A New Class of Utility Functions and a Complementary Pivot Algorithm
- Fuzzy facility location-allocation problem under the Hurwicz criterion
- A formalization of convex polyhedra based on the simplex method
- An economic interpretation of duality in linear programming
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- A generalized dual phase-2 simplex algorithm.
- A new linear programming algorithm - better or worse than the simplex method?
- On the complexity of some basic problems in computational convexity. I. Containment problems
- George Dantzig in the development of economic analysis
- George Dantzig's impact on the theory of computation
- Computation of efficient compromise arcs in convex quadratic multicriteria optimization
- Bin packing under linear constraints
- A simple direct cosine simplex algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5808752)
