A new algorithm for linear multiobjective programming problems with bounded variables (Q471311): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding all efficient extreme points for multiple objective linear programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An effective generalization of the direct support method / rank | |||
Normal rank | |||
Revision as of 06:47, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new algorithm for linear multiobjective programming problems with bounded variables |
scientific article |
Statements
A new algorithm for linear multiobjective programming problems with bounded variables (English)
0 references
14 November 2014
0 references
direct support method
0 references
\(\epsilon\)-efficient extreme points
0 references
\(\epsilon\)-weakly efficient extreme points
0 references
0 references
