On linear multiplicative programming.

DOI10.1007/BF03398519zbMath1141.90483OpenAlexW2772367608MaRDI QIDQ2468549

K. P. K. Nair, Abraham P. Punnen

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03398519

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (3)

The Bipartite QUBO ⋮ The Rank-One Quadratic Assignment Problem ⋮ The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm

Cites Work

• A feasible direction method for linear programming
• On a class of quadratic programs
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems
• Linear multiplicative programming
• Computational complexity of parametric linear programming
• A polynomial time solvable concave network flow problem
• Unnamed Item
• Unnamed Item

This page was built for publication: On linear multiplicative programming.