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

DOI10.1007/BF03398603MaRDI QIDQ2468629zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem
• An inverse logical convolution for a multiple vector minimax problem
• scientific article; zbMATH DE number 175989
• scientific article; zbMATH DE number 1205843
• Choice functions in multistage optimization

Cites work

• scientific article; zbMATH DE number 1131289 (Why is no real title available?)
• A quasiordering is the intersection of orderings
• Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem

Cited in

(1)

• Conditions for universal reducibility of a two-stage extremization problem to a one-stage problem

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

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