Pages that link to "Item:Q5817037"

The following pages link to Optimality and Degeneracy in Linear Programming (Q5817037):

Displaying 50 items.

• Primal and dual active-set methods for convex quadratic programming (Q312693) (← links)
• A linear programming decomposition focusing on the span of the nondegenerate columns (Q319585) (← links)
• The positive edge criterion within COIN-OR's CLP (Q342010) (← links)
• The use of grossone in mathematical programming and operations research (Q440662) (← links)
• A new version of the improved primal simplex for degenerate linear programs (Q733525) (← links)
• Modeling the satellite placement problem as a network flow problem with one side constraint (Q751497) (← links)
• Practical finite pivoting rules for the simplex method (Q751498) (← links)
• Page cuts for integer interval linear programming (Q754756) (← links)
• On the structure of the set bases of a degenerate point (Q795747) (← links)
• Canonical bases in linear programming (Q908850) (← links)
• A geometric consistency theorem for a symbolic perturbation scheme (Q918201) (← links)
• Efficient nested pricing in the simplex algorithm (Q943787) (← links)
• Multi-phase dynamic constraint aggregation for set partitioning type problems (Q964175) (← links)
• Pivoting rules and redundancy schemes in extreme point enumeration (Q1063390) (← links)
• Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey (Q1075251) (← links)
• A linked list data structure for a simple linear regression algorithm (Q1085037) (← links)
• A Z-simplex algorithm with partial updates (Q1097835) (← links)
• Survey of solved and open problems in the degeneracy phenomenon (Q1101009) (← links)
• A dual approach to primal degeneracy (Q1102188) (← links)
• Degeneracy in the presence of roundoff errors (Q1105984) (← links)
• On the solution of highly degenerate linear programmes (Q1106719) (← links)
• Parametric linear programming and anti-cycling pivoting rules (Q1108192) (← links)
• Intervening duality and bargaining with a farmer-landowner example. (Q1124827) (← links)
• An algorithm for a least absolute value regression problem with bounds on the parameters (Q1145473) (← links)
• A new pivoting rule for solving various degeneracy problems (Q1198621) (← links)
• A primal algorithm for interval linear-programming problems (Q1247801) (← links)
• Selected bibliography on degeneracy (Q1312748) (← links)
• Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
• Combinatoric classes of the transportation problem and their properties (Q1312755) (← links)
• Bounds on the number of vertices of perturbed polyhedra (Q1312764) (← links)
• An effective non-Archimedean anti-degeneracy/cycling linear programming method especially for data envelopment analysis and like models (Q1312766) (← links)
• An improved \(N\)-tree algorithm for the enumeration of all neighbors of a degenerate vertex (Q1312773) (← links)
• On some properties of \(0\)-degeneracy graphs (Q1312774) (← links)
• A general technique for dealing with degeneracy in reduced gradient methods for linearly constrained nonlinear programming (Q1327826) (← links)
• Large scale geometric programming: An application in coding theory (Q1332821) (← links)
• Criss-cross methods: A fresh view on pivot algorithms (Q1365063) (← links)
• Piecewise linear methods for nonlinear equations and optimization (Q1593829) (← links)
• Pivot versus interior point methods: Pros and cons (Q1598748) (← links)
• A phase-1 approach for the generalized simplex algorithm (Q1612514) (← links)
• Computing pure Nash equilibria in network revenue management games (Q1656431) (← links)
• A basis-defiency-allowing variation of the simplex method for linear programming (Q1806578) (← links)
• A unified approach to the feasible point method type for nonlinear programming with linear constraints under degeneracy and the convergence properties (Q1813345) (← links)
• On the \(\epsilon\)-perturbation method for avoiding degeneracy (Q1824546) (← links)
• Some NP-complete problems in linear programming (Q1837108) (← links)
• Revisiting a cutting-plane method for perfect matchings (Q2165581) (← links)
• A linear programming primer: from Fourier to Karmarkar (Q2177789) (← links)
• Stabilized dynamic constraint aggregation for solving set partitioning problems (Q2253353) (← links)
• Bounds on the complexity of halfspace intersections when the bounded faces have small dimension (Q2391831) (← links)
• A primal deficient-basis simplex algorithm for linear programming (Q2479158) (← links)
• A theorem of convex polyhedra in connection with the problem of finding the set of solutions to a system of linear inequalities (Q2542393) (← links)