Multiple objective programming with piecewise linear functions

DOI<322::AID-MCDA260>3.0.CO;2-5 10.1002/1099-1360(199911)8:6<322::AID-MCDA260>3.0.CO;2-5zbMath0963.90053OpenAlexW1989983933MaRDI QIDQ4516915

Stefan Nickel, Margaret M. Wiecek

Publication date: 6 March 2001

Full work available at URL: https://doi.org/10.1002/1099-1360(199911)8:6<322::aid-mcda260>3.0.co;2-5

zbMATH Keywords

multiple objective programmingefficient setpiecewise linear functionsbicriteria problemsmulticriteria programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Related Items

A parametric simplex algorithm for biobjective piecewise linear programming problems, The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces, Fully piecewise linear vector optimization problems, Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces, Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On efficient sets in vector maximum problems - A brief survey
• Sets of efficient points in a normed space
• A simplex algorithm for piecewise-linear programming. II: Finiteness, feasibility and degeneracy
• Quasiconcave vector maximization: Connectedness of the sets of Pareto- optimal and weak Pareto-optimal alternatives
• A simplex algorithm for piecewise-linear programming. III: Computational analysis and applications
• The set of all nondominated solutions in linear cases and a multicriteria simplex method
• A general method for determining the set of all efficient solutions to a linear vectormaximum problem
• Generating all maximal efficient faces for multiple objective linear programs
• Multicriteria planar location problems
• Finding all maximal efficient faces in multiobjective linear programming
• A parallel algorithm for multiple objective linear programs
• Equivalence of balance points and Pareto solutions in multiple-objective programming
• Proper efficiency and the theory of vector maximization
• A simplex algorithm for piecewise-linear programming I: Derivation and proof
• Determination of efficient points in multiple-objective location problems
• Sandwich approximation of univariate convex functions with an application to separable convex programming
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Solving Bicriterion Mathematical Programs