scientific article; zbMATH DE number 4197737
From MaRDI portal
Publication:5202836
zbMath0725.90056MaRDI QIDQ5202836
Theodore B. Trafalis, Shreeram S. Abhyankar, Thomas L. Morin
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
interior point methodpolynomial timealgebraic surfacemultiple objective optimizationbounded polyhedronset of efficient faces
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Multi-objective and goal programming (90C29) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (5)
Solving a linear multiperiod portfolio problem by interior-point methodology ⋮ Primal-dual simplex method for multiobjective linear programming ⋮ Analytic centers and repelling inequalities ⋮ An interactive interior point algorithm for multiobjective linear programming problems ⋮ Symplectic groups and permutation polynomials. II
This page was built for publication:
