Asymptotic approach to the solution of a multicriterion three-index planar problem of choice

DOI10.1023/B:CASA.0000041989.38176.49zbMATH Open1078.90051OpenAlexW1990541601MaRDI QIDQ1780259FDOQ1780259

S. A. Dichkovskaya, M. K. Kravtsov

Publication date: 7 June 2005

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:casa.0000041989.38176.49

zbMATH Keywords

approximate algorithmmulticriterion optimization\(q\)-ideal matrixasymptotically ideal solution

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Cited In (1)

• Polynomial algorithm for finding an asymptotically optimal solution to the multi-index planar choice problem.

This page was built for publication: Asymptotic approach to the solution of a multicriterion three-index planar problem of choice

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