A linear-fractional programming problem in singular cases (Q1108938): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3250135 / rank | |||
Normal rank | |||
Latest revision as of 19:01, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-fractional programming problem in singular cases |
scientific article |
Statements
A linear-fractional programming problem in singular cases (English)
0 references
1973
0 references
The author considers the following linear-fractional programming problem c'x/c''x, \(Ax=b\), \(x\geq 0\) where c',c'',x\(\in R\) n, \(b\in R\) m and A is an (m\(\times n)\)-matrix. If the denominator c''x of the objective function is bounded and of constant sign on the set of solutions of the problem, then there arises the possibility of applying the simplex method to obtain the solution of this problem.
0 references
linear-fractional programming
0 references
