Multiple objective programming with piecewise linear functions

DOI10.1002/1099-1360(199911)8:6%3C322::AID-MCDA260%3E3.0.CO;2-5MaRDI QIDQ4516915zbMATH OpenOpenAlexFDO

Authors S. Nickel, Margaret M. Wiecek

Publication date 6 March 2001

Full work available at URL https://doi.org/10.1002/1099-1360(199911)8:6%3C322::aid-mcda260%3E3.0.co;2-5

zbMATH Keywords

multiple objective programmingpiecewise linear functionsefficient setbicriteria problemsmulticriteria programming

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29)

Recommendations

• scientific article; zbMATH DE number 1264395
• Solving multiple objective linear programs in objective space
• scientific article; zbMATH DE number 1134656
• Three algorithms for bicriteria integer linear programs
• Piecewise linear multicriteria programs: the continuous case and its discontinuous generalization

Cites work

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

Cited in

(9)

• Structure of Pareto solutions of generalized polyhedral-valued vector optimization problems in Banach spaces
• The structure of weak Pareto solution sets in piecewise linear multiobjective optimization in normed spaces
• scientific article; zbMATH DE number 1878647 (Why is no real title available?)
• Piecewise linear multicriteria programs: the continuous case and its discontinuous generalization
• Fully piecewise linear vector optimization problems
• A modified goal programming model for piecewise linear functions
• A parametric simplex algorithm for biobjective piecewise linear programming problems
• An algorithm for linearly-constrained piecewise lexicographic programming problems.
• Pareto solutions of polyhedral-valued vector optimization problems in Banach spaces

This page was built for publication: Multiple objective programming with piecewise linear functions

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