A new algorithm for linear multiobjective programming problems with bounded variables

DOI10.1007/s40065-013-0094-xzbMath1332.90253OpenAlexW2148384465WikidataQ59318124 ScholiaQ59318124MaRDI QIDQ471311

Sonia Radjef, Mohand Ouamer Bibi

Publication date: 14 November 2014

Published in: Arabian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40065-013-0094-x

zbMATH Keywords

\(\epsilon\)-efficient extreme points\(\epsilon\)-weakly efficient extreme pointsdirect support method

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Linear programming (90C05) Renewal theory (60K05)

Related Items (3)

Constrained integer fractional programming problem with box constraints ⋮ Generation of efficient and ε -efficient solutions in multiple objective linear programming ⋮ Bi-objective capacitated transportation problem with bounds over distributions and requirement capacities

Cites Work

• An effective generalization of the direct support method
• Finding an Initial Efficient Extreme Point for a Linear Multiple Objective Program
• Finding all efficient extreme points for multiple objective linear programs
• Support method for solving a linear-quadratic problem with polythedral with polyhedral constraints on control

This page was built for publication: A new algorithm for linear multiobjective programming problems with bounded variables