scientific article; zbMATH DE number 3209723
From MaRDI portal
Publication:5336851
zbMath0128.39605MaRDI QIDQ5336851
Publication date: 1954
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Unnamed Item ⋮ A Z-simplex algorithm with partial updates ⋮ Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms ⋮ A Survey on Numerical Methods for the Simulation of Initial Value Problems with sDAEs ⋮ Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function ⋮ The positive edge pricing rule for the dual simplex ⋮ On the existence of a short pivoting sequence for a linear program ⋮ Implementing the simplex method as a cutting-plane method, with a view to regularization ⋮ A dual projective simplex method for linear programming ⋮ New techniques for linear arithmetic: cubes and equalities ⋮ A partitioning algorithm for the multicommodity network flow problem ⋮ Canonical bases in linear programming ⋮ Another pedagogy for pure-integer Gomory ⋮ An exploratory computational analysis of dual degeneracy in mixed-integer programming ⋮ The discrete moment problem with fractional moments ⋮ Ein lineares Programmierungsverfahren ⋮ Robust newsvendor problems with compound Poisson demands ⋮ On direct sums and tensor products of linear programs ⋮ Note on linear programming ⋮ Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution ⋮ A comparison of primal and dual methods of linear programming ⋮ The discrete moment problem and linear programming ⋮ A generalized dual phase-2 simplex algorithm. ⋮ An interval programming algorithm for discrete linear \(L_ 1\) approximation problems ⋮ A suboptimization method for interval linear programming: A new method for linear programming ⋮ Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation ⋮ The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study ⋮ Conflict Analysis for MINLP ⋮ Robust newsvendor problems: effect of discrete demands ⋮ Pivot versus interior point methods: Pros and cons ⋮ An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models ⋮ An exterior point simplex algorithm for (general) linear programming problems
This page was built for publication:
