On stability of lexicographical solution of vector minimax quadratic Boolean problem

Publication date 5 September 2012

Published in Trudy Instituta Matematiki (Search for Journal in Brave)

lexicographical ordering quadratic Boolean order functional stability vector minimax problem

Boolean programming (90C09) Multi-objective and goal programming (90C29) Minimax problems in mathematical programming (90C47)

Review text

The paper deals with a lexicographical ordering by using \(k=1,2,\dots,s\) quadratic order functionals \(f_k(x,A_k)=\max_{y\in Y}y^TA_kx\) where \(Y,X\) are finite sets in finite dimensional real spaces and extensively estimates an introduced stability radius \(\rho\) by upper and lower bounds. The introduced stability do not seem to be a sustainable and elaborate concept. The finally introduced strict ordering yields (as can easily be shown) that the solution set \(S^s(A)\) is single valued or empty and it is defined only by using the first order functional \(f_1\). However the radius \(\rho\) is positive (equivalent to stability) if and only if \(S^s(A)\neq \emptyset\). Hence the paper essentially considers the very special case that already the first ordering in the \(s\)-time lexicographical order yields a single minimal element in \(X\) and thus further \(s-1\) orderings and finally the lexicographic ordering are unsubstantial in this concept.

Recommendations

Cited in

(8)

This page was built for publication: On stability of lexicographical solution of vector minimax quadratic Boolean problem

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