Two direct methods in linear programming

DOI10.1016/S0377-2217(00)00083-7MaRDI QIDQ5935423zbMATH OpenFDO

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

Publication date 26 June 2001

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

Full work available at URL https://doi.org/10.1016/S0377-2217(00)00083-7

zbMATH Keywords

game theorylinear programmingMATHEMATICAtangential polyhedron

Mathematics Subject Classification ID

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

Recommendations

• A note on two direct methods in linear programming
• scientific article; zbMATH DE number 3867061
• scientific article; zbMATH DE number 2166871
• Direct-dual block method of linear programming
• scientific article; zbMATH DE number 5251052
• Two-Level Linear Programming
• scientific article; zbMATH DE number 1786124
• scientific article; zbMATH DE number 4197293
• Direct methods for the solution of linear systems
• scientific article; zbMATH DE number 3543799

Cites work

• HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
• scientific article; zbMATH DE number 107539 (Why is no real title available?)
• scientific article; zbMATH DE number 1047679 (Why is no real title available?)
• scientific article; zbMATH DE number 953808 (Why is no real title available?)
• scientific article; zbMATH DE number 792643 (Why is no real title available?)
• scientific article; zbMATH DE number 3257031 (Why is no real title available?)
• scientific article; zbMATH DE number 3365042 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)

Cited in

(18)

• Direct-dual block method of linear programming
• Improved linear programming methods for checking avoiding sure loss
• A note on two direct methods in linear programming
• On the simplex algorithm initializing
• An improved initial basis for the simplex algorithm
• A simple direct cosine simplex algorithm
• Global attitude and gyro bias estimation based on set-valued observers
• Algebraic simplex initialization combined with the nonfeasible basis method
• A heuristic approach for identification of redundant constraints in linear programming models
• A heuristic algorithm for resource allocation/reallocation problem
• 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
• A comparative study of redundant constraints identification methods in linear programming problems
• MILP acceleration: a survey from perspectives of simplex initialization and learning-based branch and bound
• Hybrid-LP: finding advanced starting points for simplex, and pivoting LP methods
• A note on ``An improved initial basis for the simplex algorithm
• The complex interior-boundary method for linear and nonlinear programming with linear constraints

Describes a project that uses

Uses Software

• Mathematica
• HOPDM
• PCx
• NETLIB LP Test Set

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5935423)