2020
DOI: 10.1002/cpe.5836
|View full text |Cite
|
Sign up to set email alerts
|

A new method with hybrid direction for linear programming

Abstract: Summary In this work, we propose a new algorithm for solving linear programs. This algorithm starts by an initial support feasible solution, then it moves from one feasible point to a better one following a new hybrid direction. The constructed direction gives a better local improvement of the objective function than the direction of the adaptive method with hybrid direction (AMHD) algorithm proposed in Bibi MO, Bentobache M. A hybrid direction algorithm for solving linear programs. International Journal of Co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2020
2020
2020
2020

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…The 11th paper, entitled “A new method with hybrid direction for linear programming” by Djeloud et al 11 . proposes a new algorithm for solving linear programming problems with bounded variables.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…The 11th paper, entitled “A new method with hybrid direction for linear programming” by Djeloud et al 11 . proposes a new algorithm for solving linear programming problems with bounded variables.…”
Section: Introductionmentioning
confidence: 99%
“…The 11th paper, entitled "A new method with hybrid direction for linear programming" by Djeloud et al 11 proposes a new algorithm for solving linear programming problems with bounded variables. This method uses a new hybrid direction to improve the current solution and a long step rule to change the current support.…”
mentioning
confidence: 99%