Reducing a multi stage vector optimization problem to a single stage vector optimization problem.

DOI10.1007/BF03398603zbMath1141.90523OpenAlexW3125804674MaRDI QIDQ2468629

Somdeb Lahiri

Publication date: 25 January 2008

Published in: Opsearch (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Cites Work

• Unnamed Item
• Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem
• A quasiordering is the intersection of orderings

This page was built for publication: Reducing a multi stage vector optimization problem to a single stage vector optimization problem.