On linear multiplicative programming.

DOI10.1007/BF03398519MaRDI QIDQ2468549zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Linear multiplicative programming
• Finite algorithm for generalized linear multiplicative programming
• Global optimization of multiplicative programs
• scientific article; zbMATH DE number 757680
• Heuristic methods for linear multiplicative programming

Cites work

• scientific article; zbMATH DE number 3231716 (Why is no real title available?)
• scientific article; zbMATH DE number 3231717 (Why is no real title available?)
• A feasible direction method for linear programming
• A polynomial time solvable concave network flow problem
• Computational complexity of parametric linear programming
• Linear multiplicative programming
• On a class of quadratic programs
• Parametric simplex algorithms for solving a special class of nonconvex minimization problems

Cited in

(7)

• The Rank-One Quadratic Assignment Problem
• The bipartite QUBO
• A vector linear programming approach for certain global optimization problems
• Linear multiplicative programming
• Unifying Condition Numbers for Linear Programming
• scientific article; zbMATH DE number 1889697 (Why is no real title available?)
• The quadratic minimum spanning tree problem: a lower bounding procedure and an efficient search algorithm

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

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