A note on bicriterion programming

DOI10.1007/BF02591909zbMath0526.90079OpenAlexW2094976929WikidataQ56324196 ScholiaQ56324196MaRDI QIDQ3040940

No author found.

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)

Related Items (1)

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

Cites Work

• Unnamed Item
• Vector maximization with two objective functions
• A Lower Bound to Finding Convex Hulls
• On Finding the Maxima of a Set of Vectors
• An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
• Solving Bicriterion Mathematical Programs
• Technical Note—Parametric Solution of a Class of Nonconvex Programs

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