Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software
type: Item
instance of: scholarly article
title: Goal-optimal Pareto solution of multiobjective linear programs and its computing with standard single objective LP software
zbMATH Open document ID: 1080.90067
DOI: 10.1016/S0895-7177(03)00086-4
published in: Mathematical and Computer Modelling
publication date: 2004-08-06T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C08
zbMATH DE Number: 2082689
zbMATH Keywords: MCDM
zbMATH Keywords: Pareto solution
zbMATH Keywords: Balance set
zbMATH Keywords: Goal programming
author: E. A. Galperin
MaRDI profile type: Publication
cites work: Q3930962
cites work: Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
cites work: Finding all efficient extreme points for multiple objective linear programs
cites work: Necessary and Sufficient Conditions for a Pareto Optimum in Convex Programming
cites work: A saddle-point characterization of Pareto optima
cites work: A characterization of weakly efficient points
cites work: Q3134860
cites work: Nonscalarized multiobjective global optimization
cites work: Equivalence of balance points and Pareto solutions in multiple-objective programming
cites work: Pareto analysis vis-à-vis balance space approach in multiobjective global optimization
cites work: Retrieval and use of the balance set in multiobjective global optimization
cites work: Duality of nonscalarized multiobjective linear programs: dual balance, level sets, and dual clusters of optimal vectors.
cites work: Balance space in airport construction: Application to the North Sea island option for Schiphol Airport
cites work: Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
cites work: Optimal maintenance headcount allocation: an application of Chebyshev Goal Programming
cites work: Q4180077
cites work: Q3716769
cites work: An interactive weighted Tchebycheff procedure for multiple objective programming
cites work: Theory of multiobjective optimization
cites work: Q3815146
full work available at URL: s0895-7177(03)00086-4
OpenAlex ID: W1974926966
description: scientific article; zbMATH DE number 2082689