An algorithm for solving a class of discrete multicriterion problems

DOI10.1016/S0041-5553(83)80099-8zbMATH Open0584.90091MaRDI QIDQ3710331

M. G. Krejnes, N. M. Novikova

Publication date: 1983

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

monotonic constraintsmulticriterion discrete optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Related Items (5)

A survey of interval algorithms for solving multicriteria analysis problems ⋮ Monomial Tropical Cones for Multicriteria Optimization ⋮ A new algorithm for the multi-item exponentially discounted optimal selection problem. ⋮ Title not available (Why is that?) ⋮ Numerical analysis of algorithms for solving bicriteria discrete programming problems

Recommendations

• An improved method for solving multiple criteria problems involving discrete alternatives 👍 👎
• Finding the set of alternatives in discrete multicriterion problems 👍 👎
• Solving multiobjective programming problems by discrete representation 👍 👎
• Complexity of discrete multicriteria problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: An algorithm for solving a class of discrete multicriterion problems

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