Insoluble multicriteria linear programming problems

DOI10.1007/BF00941831MaRDI QIDQ1102874zbMATH OpenOpenAlexFDO

Authors M. E. Salukvadze, A. L. Topchishvili

Publication date 1989

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

insoluble multicriteria linear programming problems

Mathematics Subject Classification ID

Linear programming (90C05) Sensitivity, stability, parametric optimization (90C31)

Review text

This note concerns a method for analyzing insoluble multicriteria linear programming problems.

Cites work

• Block-iterative methods for consistent and inconsistent linear equations
• Determining feasibility of a set of nonlinear inequality constraints
• scientific article; zbMATH DE number 3926625 (Why is no real title available?)
• scientific article; zbMATH DE number 4025152 (Why is no real title available?)
• Normal solutions of linear programs
• Vector-valued optimization problems in control theory. Transl. from the Russian by John L. Casti

Cited in

(4)

• Weakly-efficient solutions of limiting multicriteria optimization problems
• Fuzzy approximation to an infeasible generalized linear complementarity problem
• Multiple-objective approximation of feasible but unsolvable linear complementarity problems
• An LP-based algorithm for the correction of inconsistent linear equation and inequality systems

This page was built for publication: Insoluble multicriteria linear programming problems

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