Probing through the intersection of hyperplanes (Q1262211): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Guoliang Xue / rank | |||
Property / reviewed by | |||
Property / reviewed by: Guoliang Xue / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0167-6377(89)90044-8 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2016852223 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The pivot and probe algorithm for solving a linear program / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solution of constrained generalized transportation problems using the pivot and probe algorithm / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 11:31, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Probing through the intersection of hyperplanes |
scientific article |
Statements
Probing through the intersection of hyperplanes (English)
0 references
1989
0 references
The authors study the linear programming problem of the form max \(c^ Tx\) subject to \(Ax=b\) and \(x=0\) where the elements of A and b are assumed to be nonnegative. The pivot and probe algorithm is as follows. A relaxed linear program is solved. If the solution to the relaxed program is feasible to the original program, it is also optimal. Otherwise some most violated constraints are added to the relaxed program and the new relaxed linear program is solved again. This process is repeated until an optimal solution is found. In this paper, a variant of probe is suggested. Computational results show that this algorithm is faster than the simplex algorithm.
0 references
candidate constraint
0 references
non-candidate constraints
0 references
pivot and probe algorithm
0 references
Computational results
0 references
simplex algorithm
0 references