Finite algorithm for minimizing the product of two linear functions over a polyhedron

DOI10.3934/jimo.2007.3.481zbMath1166.90365OpenAlexW2324829368MaRDI QIDQ2468860

Nguyen Thi Bach Kim

Publication date: 11 February 2008

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2007.3.481

zbMATH Keywords

minimizing the product of two linear functions over a polyhedron

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items (1)

Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming

This page was built for publication: Finite algorithm for minimizing the product of two linear functions over a polyhedron