The following pages link to (Q5336851):
Displaying 32 items.
- The positive edge pricing rule for the dual simplex (Q337606) (← links)
- Implementing the simplex method as a cutting-plane method, with a view to regularization (Q377719) (← links)
- The discrete moment problem and linear programming (Q749441) (← links)
- Canonical bases in linear programming (Q908850) (← links)
- Progress in the dual simplex algorithm for solving large scale LP problems: Techniques for a fast and stable implementation (Q1029627) (← links)
- A Z-simplex algorithm with partial updates (Q1097835) (← links)
- A dual projective simplex method for linear programming (Q1129474) (← links)
- The most-obtuse-angle row pivot rule for achieving dual feasibility: A computational study (Q1278948) (← links)
- An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models (Q1312766) (← links)
- An exterior point simplex algorithm for (general) linear programming problems (Q1312781) (← links)
- Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
- New techniques for linear arithmetic: cubes and equalities (Q1688532) (← links)
- A generalized dual phase-2 simplex algorithm. (Q1811141) (← links)
- Solution of and bounding in a linearly constrained optimization problem with convex, polyhedral objective function (Q1904656) (← links)
- An exploratory computational analysis of dual degeneracy in mixed-integer programming (Q2219511) (← links)
- Robust newsvendor problems with compound Poisson demands (Q2241144) (← links)
- Robust newsvendor problems: effect of discrete demands (Q2327693) (← links)
- The discrete moment problem with fractional moments (Q2450764) (← links)
- A comparison of primal and dual methods of linear programming (Q2525099) (← links)
- An interval programming algorithm for discrete linear \(L_ 1\) approximation problems (Q2544339) (← links)
- A suboptimization method for interval linear programming: A new method for linear programming (Q2545859) (← links)
- Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms (Q2642636) (← links)
- On the existence of a short pivoting sequence for a linear program (Q2661547) (← links)
- Another pedagogy for pure-integer Gomory (Q2969967) (← links)
- (Q3289998) (← links)
- Ein lineares Programmierungsverfahren (Q3290209) (← links)
- A Survey on Numerical Methods for the Simulation of Initial Value Problems with sDAEs (Q4556662) (← links)
- Conflict Analysis for MINLP (Q4995080) (← links)
- Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution (Q5202511) (← links)
- A partitioning algorithm for the multicommodity network flow problem (Q5668269) (← links)
- On direct sums and tensor products of linear programs (Q5736641) (← links)
- Note on linear programming (Q5920762) (← links)
