scientific article; zbMATH DE number 4137549

MaRDI QIDQ3470264zbMATH OpenFDO

Authors Siegfried Helbig

Publication date 1990

zbMATH Keywords

disjunctive setefficient pointpseudo-convex objective functionsvector optimization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Sensitivity, stability, parametric optimization (90C31)

Recommendations

• scientific article; zbMATH DE number 175989
• scientific article; zbMATH DE number 3887462
• Multi-objective optimization over convex disjunctive feasible sets using reference points
• Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
• On an algorithm for solving a linear vector optimization problem

Cited in

(5)

• Multi-objective optimization over convex disjunctive feasible sets using reference points
• Nonscalarized multiobjective global optimization
• Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
• Retrieval and use of the balance set in multiobjective global optimization
• Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.

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 Q3470264)