Normal cone method in solving linear multiobjective problems

DOI10.1080/09720510.2002.10701063zbMATH Open1079.90598OpenAlexW2316000744MaRDI QIDQ5708476FDOQ5708476

Nguyen Thi Bach Kim, Dinh The Luc

Publication date: 18 November 2005

Published in: Journal of Statistics and Management Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/09720510.2002.10701063

zbMATH Keywords

normal coneweakly efficient solutionlinear multiobjective problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)

Cited In (4)

• Saddle points and scalarizing sets in multiple objective linear programming
• On duality in multiple objective linear programming
• Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
• Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming

This page was built for publication: Normal cone method in solving linear multiobjective problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5708476)