A note on bicriterion programming

DOI10.1007/BF02591909MaRDI QIDQ3040940zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1983

Published in Mathematical Programming (Search for Journal in Brave)

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

zbMATH Keywords

complexitycomplete enumerationbicriterion vector maximum problemseparable objectives

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31)

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• A Lower Bound to Finding Convex Hulls
• An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
• On Finding the Maxima of a Set of Vectors
• Solving Bicriterion Mathematical Programs
• Technical Note—Parametric Solution of a Class of Nonconvex Programs
• Vector maximization with two objective functions

Cited in

(1)

• An algorithm for a separable integer programming problem with cumulatively bounded variables

This page was built for publication: A note on bicriterion programming

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