A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming (Q6569145)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming |
scientific article; zbMATH DE number 7878266
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming |
scientific article; zbMATH DE number 7878266 |
Statements
A one-dimensional branching rule based branch-and-bound algorithm for minimax linear fractional programming (English)
0 references
8 July 2024
0 references
minimax linear fractional program
0 references
global optimization
0 references
linear relaxation
0 references
branch-and-bound
0 references
one-dimensional branching
0 references
convergence analysis
0 references
0 references
0 references
0 references
0 references
