A note on bicriterion programming (Q3040940): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4091421 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Vector maximization with two objective functions / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Solving Bicriterion Mathematical Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Technical Note—Parametric Solution of a Class of Nonconvex Programs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On Finding the Maxima of a Set of Vectors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Lower Bound to Finding Convex Hulls / rank | |||
Normal rank |
Revision as of 11:14, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on bicriterion programming |
scientific article |
Statements
A note on bicriterion programming (English)
0 references
1983
0 references
complexity
0 references
bicriterion vector maximum problem
0 references
separable objectives
0 references
complete enumeration
0 references
0 references