An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint

DOI10.1016/j.ejor.2003.09.022zbMath1120.90364OpenAlexW1969772668MaRDI QIDQ706934

Yuji Nakagawa, Ross J. W. James, Yuriko Isada

Publication date: 9 February 2005

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2003.09.022

zbMATH Keywords

Decision support systemsNonlinearDiscreteMultiple objective programmingTarget problem

Mathematics Subject Classification ID

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

Related Items (2)

Zero duality gap in surrogate constraint optimization: a concise review of models ⋮ What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods?

Cites Work

• Unnamed Item
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• On a multicriteria shortest path problem
• How to make a decision: The analytic hierarchy process
• Zero-one programming with multiple criteria
• Decision support system for the composition of the examination problem
• Nonlinear multiobjective optimization
• An improved interactive hybrid method for the linear multi-objective knapsack problem
• An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
• Tabu search based procedure for solving the 0-1 multiobjective knapsack problem: The two objectives case
• The nonlinear knapsack problem - algorithms and applications
• Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
• A survey and annotated bibliography of multiobjective combinatorial optimization
• The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
• Reliability optimization of systems by a surrogate-constraints algorithm
• Branch-and-Bound Strategies for Dynamic Programming
• A hybrid approach to discrete mathematical programming
• The Multiple-Choice Knapsack Problem
• AN IMPROVED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
• Technical Note—Proper Efficiency and the Linear Vector Maximum Problem
• Multi-objective meta-heuristics: An overview of the current state-of-the-art
• A pegging algorithm for the nonlinear resource allocation problem

This page was built for publication: An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint