Selected bibliography on degeneracy (Q1312748)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Selected bibliography on degeneracy	scientific article

Statements

scholarly article

0 references

Selected bibliography on degeneracy (English)

0 references

zbMATH Open document ID

0 references

10.1007/BF02096255

0 references

0 references

Annals of Operations Research

0 references

publication date

7 February 1994

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

selected bibliography

0 references

degeneracy problems

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

On the choice of the pivot columns of the simplex-method: Gradient criteria

0 references

A Family of Simplex Variants Solving an <i>m</i> × <i>d</i> Linear Program in Expected Number of Pivot Steps Depending on <i>d</i> Only

0 references

Degeneracy in fixed cost transportation problems

0 references

Minimax linear programming problem

0 references

A Note on Shadow Prices in Linear Programming

0 references

An algorithm for enumerating all vertices of a convex polyhedron

0 references

0 references

Bounds on the number of vertices of perturbed polyhedra

0 references

The Computation of Shadow Prices in Linear Programming

0 references

0 references

A decision rule in the simplex method that avoids cycling

0 references

An Algorithm for Finding All Vertices of Convex Polyhedral Sets

0 references

On the average length of lexicographic paths

0 references

A variation on Karmarkar’s algorithm for solving linear programming problems

0 references

The alternating basis algorithm for assignment problems

0 references

The generalized alternating path algorithm for transportation problems

0 references

On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense

0 references

Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System

0 references

The efficient solution of large-scale linear programming problems—some algorithmic techniques and computational results

0 references

New Finite Pivoting Rules for the Simplex Method

0 references

0 references

Solving multifacility location problems involving euclidean distances

0 references

A Stable Algorithm for Solving the Multifacility Location Problem Involving Euclidean Distances

0 references

0 references

Projected gradient methods for linearly constrained problems

0 references

0 references

Least-index resolution of degeneracy in quadratic programming

0 references

Optimality and Degeneracy in Linear Programming

0 references

0 references

Theoretical Properties of the Network Simplex Method

0 references

On cycling in the network simplex method

0 references

Making progress during a stall in the simplex algorithm

0 references

The generalized simplex method for minimizing a linear form under linear inequality restraints

0 references

On computational aspects of bounded linear least squares problems

0 references

0 references

On three basic methods for solving bottleneck transportation problems

0 references

The Complexity of Vertex Enumeration Methods

0 references

An algorithm for determining all extreme points of a convex polytope

0 references

An improved vertex enumeration algorithm

0 references

A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy

0 references

A general method for determining the set of all efficient solutions to a linear vectormaximum problem

0 references

0 references

On the structure of the set bases of a degenerate point

0 references

Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey

0 references

Weakly redundant constraints and their impact on postoptimal analyses in LP

0 references

A new pivoting rule for solving various degeneracy problems

0 references

Survey of solved and open problems in the degeneracy phenomenon

0 references

Bottleneck linear programming

0 references

Cycling in the transportation problem

0 references

0 references

An analysis of degeneracy

0 references

Degeneracy in interior point methods for linear programming: A survey

0 references

Multi-criteria simplex method for a linear multiple-objective transportation problem

0 references

Time‐minimizing transportation problems

0 references

Pivot selection methods of the Devex LP code

0 references

A dual approach to primal degeneracy

0 references

On finding new vertices and redundant constraints in cutting plane algorithms for global optimization

0 references

The enumeration of all efficient solutions for a linear multiple-objective transportation problem

0 references

A note on solving multifacility location problems involving euclidean distances

0 references

An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem

0 references

Redundancy in mathematical programming. A state-of-the-art survey

0 references

Cycling in linear complementarity problems

0 references

Degeneracy graphs and the neighbourhood problem

0 references

A Note on Resolution of Degeneracy in Transportation Problems

0 references

Parametric linear programming and anti-cycling pivoting rules

0 references

A note on cycling in the simplex method

0 references

A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets

0 references

Some computational results of using the Ahrens—Finke method for handling degeneracy in fixed charge transportation problems

0 references

A note on degeneracy in linear programming

0 references

On finding a vertex solution using interior point methods

0 references

0 references

0 references

Degeneracy in integer linear optimization problems: A selected bibliography

0 references

A possible way to reduce degeneracy in integer programming computations

0 references

Practical finite pivoting rules for the simplex method

0 references

0 references

Vector maximization at a degenerate vertex

0 references

0 references

0 references

A regularized decomposition method for minimizing a sum of polyhedral functions

0 references

On the solution of highly degenerate linear programmes

0 references

On the bottleneck linear programming problem

0 references

An extreme-point-ranking algorithm for the extreme-point mathematical programming problem

0 references

Techniques for Removing Nonbinding Constraints and Extraneous Variables from Linear Programming Problems

0 references

An implementation of the simplex method for linear programming problems with variable upper bounds

0 references

Probabilistic Models for Linear Programming

0 references

Formal optimization of some reduced linear programming problems

0 references

The explicit derivation of the efficient portfolio frontier in the case of degeneracy and general singularity

0 references

Pivoting rules and redundancy schemes in extreme point enumeration

0 references

Marginal Values in Linear Programming

0 references

A Technique for Resolving Degeneracy in Linear Programming

0 references

A Simplified Primal (All-Integer) Integer Programming Algorithm

0 references

On anti-cycling pivoting rules for the simplex method

0 references

Degeneracy graphs and simplex cycling

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1312748

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1312748&oldid=34117844"