Two direct methods in linear programming

DOI10.1016/S0377-2217(00)00083-7zbMath0991.90087MaRDI QIDQ5935423

Predrag S. Stanimirović, Nebojša V. Stojković

Publication date: 26 June 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

game theorylinear programmingMATHEMATICAtangential polyhedron

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Extreme-point and pivoting methods (90C49) Experimental studies (91A90)

Related Items (15)

Algebraic simplex initialization combined with the nonfeasible basis method ⋮ An improved initial basis for the simplex algorithm ⋮ A simple direct cosine simplex algorithm ⋮ A note on ``An improved initial basis for the simplex algorithm ⋮ On the simplex algorithm initializing ⋮ A heuristic algorithm for resource allocation/reallocation problem ⋮ A comparative study of redundant constraints identification methods in linear programming problems ⋮ Global attitude and gyro bias estimation based on set-valued observers ⋮ Artificial-free simplex algorithm based on the non-acute constraint relaxation ⋮ Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints ⋮ On simplex method with most-obtuse-angle rule and cosine rule ⋮ Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods ⋮ The complex interior-boundary method for linear and nonlinear programming with linear constraints ⋮ A note on two direct methods in linear programming ⋮ A heuristic approach for identification of redundant constraints in linear programming models

Uses Software

• Mathematica
• HOPDM
• PCx
• NETLIB LP Test Set

Cites Work

• HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Two direct methods in linear programming