On a particular quadratic network problem

DOI10.1016/0377-2217(87)90245-1MaRDI QIDQ580183zbMATH OpenOpenAlexFDO

Authors Ernesto Queirós Vieira Martins

Publication date 1987

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(87)90245-1

zbMATH Keywords

convex polyhedronmultiobjective programmingquadratic form

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Sensitivity, stability, parametric optimization (90C31) Programming involving graphs or networks (90C35)

Review text

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.

Recommendations

• scientific article; zbMATH DE number 778347
• A Method for Solving Certain Quadratic Programming Problems Arising in Nonsmooth Optimization
• scientific article; zbMATH DE number 4018776
• scientific article; zbMATH DE number 4093200
• scientific article; zbMATH DE number 4070204

Cites work

• A network simplex method
• scientific article; zbMATH DE number 3965788 (Why is no real title available?)
• scientific article; zbMATH DE number 3552183 (Why is no real title available?)
• Linear multiobjective programming
• The cyclic method of solving the transshipment problem with an additional linear constraint

Cited in

(5)

• Multiobjective transportation network design and routing problems: Taxonomy and annotation
• Analytic efficient solution set for bi-criteria quadratic network programs
• Ernesto de Queirós Vieira Martins (1945-2000): An appreciation by Mário S. Rosa
• Linear complementarity problems and multiple objective programming
• A network approach for specially structured linear programs arising in 0-1 quadratic optimization

This page was built for publication: On a particular quadratic network problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q580183)