An interactive method for multiple-objective mathematical programming problems

DOI10.1007/BF00940069zbMath0697.90074OpenAlexW2019228999MaRDI QIDQ911999

N. E. Zubov

Publication date: 1991

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940069

zbMATH Keywords

efficient solutionpartial informationinteractive methodfeasible direction methodsbest compromise solutionline search variationsnonlinear multiple objective mathematical programmingtradeoff cutting plane

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Management decision making, including multiple objectives (90B50)

Related Items (12)

Solving multiple-objective problems in the objective space ⋮ DEA based dimensionality reduction for classification problems satisfying strict non-satiety assumption ⋮ On some multiobjective optimization problems arising in biology ⋮ Using efficient feasible directions in interactive multiple objective linear programming ⋮ Interactive classification using data envelopment analysis ⋮ A comparative study of interactive tradeoff cutting plane methods for MOMP ⋮ A decision support system for discrete multiple-criteria problems: Certainty, uncertainty, and hierarchical ⋮ An interactive multi-objective gradient search ⋮ Interactive multiple objective optimization: Survey. I: Continuous case ⋮ Comparative studies in interactive multiple objective mathematical programming ⋮ Screening discrete alternatives with imprecisely assessed additive multi- attribute functions ⋮ An interactive interior point algorithm for multiobjective linear programming problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive multiobjective complex search
• Interactive algorithms for multiple criteria nonlinear programming problems
• Interactive multiobjective decision making by the sequential proxy optimization technique: SPOT
• Proper efficiency and the theory of vector maximization
• Cone convexity, cone extreme points, and nondominated solutions in decision problems with multiobjectives
• A Survey of Multiple Criteria Integer Programming Methods
• An Overview of Techniques for Solving Multiobjective Mathematical Programs
• An Interactive Multiple Objective Linear Programming Method for a Class of Underlying Nonlinear Utility Functions
• A Convergent Interactive Cutting-Plane Algorithm for Multiobjective Optimization
• A Tradeoff Cut Approach to Multiple Objective Optimization
• An Interactive Programming Method for Solving the Multiple Criteria Problem
• A Proxy Approach to Multi-Attribute Decision Making
• An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems
• An Interactive Approach for Multi-Criterion Optimization, with an Application to the Operation of an Academic Department
• A Time-Sharing Computer Program for the Solution of the Multiple Criteria Problem

This page was built for publication: An interactive method for multiple-objective mathematical programming problems