scientific article; zbMATH DE number 3988071

MaRDI QIDQ3752154zbMATH OpenFDO

Authors Stefan Tigan

Publication date 1986

zbMATH Keywords

finite algorithmquasimonotonic max-min problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55) Existence of solutions for minimax problems (49J35)

Recommendations

• scientific article; zbMATH DE number 4202029
• On alternative optimal solutions to quasimonotonic programming with linear constraints
• A class of quadratic programs with linear complementarity constraints
• Maximin Problem and a Duality Theorem for Mixed‐Integer Quadratic Programming
• On quasimonotonic integer programming problems
• On convex quadratic programs with linear complementarity constraints
• scientific article; zbMATH DE number 1163112
• On the minimax solution of multiple linear-quadratic problems
• Une borne optimale pour la programmation entière quasi-convexe
• scientific article; zbMATH DE number 4145675

Cited in

(4)

• scientific article; zbMATH DE number 1664599 (Why is no real title available?)
• On alternative optimal solutions to quasimonotonic programming with linear constraints
• On quasimonotonic integer programming problems
• scientific article; zbMATH DE number 468799 (Why is no real title available?)

This page was built for publication:

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