A new algorithm for linear multiobjective programming problems with bounded variables
From MaRDI portal
Recommendations
- Generation of efficient and ε -efficient solutions in multiple objective linear programming
- An effective generalization of the direct support method
- Solving multiobjective linear programming problems using ball center of polytopes
- Solving multiple objective linear programs in objective space
- scientific article; zbMATH DE number 4199982
Cites work
- An effective generalization of the direct support method
- Finding all efficient extreme points for multiple objective linear programs
- Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
- Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control
Cited in
(6)- Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities
- An effective generalization of the direct support method
- Generation of efficient and ε -efficient solutions in multiple objective linear programming
- Constrained integer fractional programming problem with box constraints
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- scientific article; zbMATH DE number 5000797 (Why is no real title available?)
This page was built for publication: A new algorithm for linear multiobjective programming problems with bounded variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q471311)