On a particular quadratic network problem (Q580183): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0377-2217(87)90245-1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1964821805 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A network simplex method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4126046 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3734141 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The cyclic method of solving the transshipment problem with an additional linear constraint / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear multiobjective programming / rank | |||
Normal rank |
Latest revision as of 11:16, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On a particular quadratic network problem |
scientific article |
Statements
On a particular quadratic network problem (English)
0 references
1987
0 references
This paper studies the quadratic function defined by \(f(x)=g(x)+h(x)\) over a convex polyhedron X, where g(x) is a quadratic form. The mathematical background related to quadratic forms and multiobjective programming is presented in Section 2. The problem is studied assuming that g(x) is a positive semidefinite quadratic form. A nonlinear problem arises and three theorems characterize it and an algorithm is given for solving it. A procedure is proposed for implementing the algorithm. The negative semidefiniteness of g(x) fixes another problem which is similarly studied. Two theorems are given and another algorithm is proposed. The study of the indefinite case is accomplished in three theorems that fix the corresponding theory but no algorithm is proposed. The algorithms are multiobjective programming based.
0 references
convex polyhedron
0 references
quadratic form
0 references
multiobjective programming
0 references
0 references