An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint
Explore this paper's citation graph
Summary
The approach converts the multi-objective problem into a single objective problem by using surrogate multipliers from which the authors find all the solutions with objective values within a given range by using an algorithm based on the modular approach.
- Type
- article
- Published
- 2005-04-16
- Cited by
- 7
- References
- 29
- OpenAlex
- https://openalex.org/W1969772668
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:10401816
Keywords
Mathematical optimization, Separable space, Constraint (computer-aided design), Discrete optimization, Nonlinear system
References
- OPTIMIZATION OF DISCRETE-TIME, STOCHASTIC SYSTEMS ∗
- A REINFORCED SURROGATE CONSTRAINTS METHOD FOR SEPARABLE NONLINEAR INTEGER PROGRAMMING
- Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems
- Technical Note - Proper Efficiency and the Linear Vector Maximum Problem
- Decision support system for the composition of the examination problem
- A pegging algorithm for the nonlinear resource allocation problem
- Nonlinear multiobjective optimization
- Multi-objective meta-heuristics: An overview of the current state-of-the-art
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- On a multicriteria shortest path problem
- Zero--one programming with multiple criteria
- 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
- A hybrid approach to discrete mathematical programming
- The use of dynamic programming methodology for the solution of a class of nonlinear programming problems
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A new method for discrete optimization problems
- An annotated overview of system-reliability optimization
- Reliability optimization of systems by a surrogate-constraints algorithm
Cited by
- A decision support method for school relocation planning
- Zero duality gap in surrogate constraint optimization: A concise review of models
- What Foreclosed Homes Should a Municipality Purchase to Stabilize Vulnerable Neighborhoods?
- Application and Visualization of the Many-objective Nonlinear Knapsack problem
- Exploring the Customization Decision Support System Using Waypoint Solutions
- MEDIA PLANNING PROBLEMS FOR JAPANESE NEWSPAPER CONSIDERING PAGE SPACE
- Exploring the Customization Decision Support System Using Waypoint Solutions
- Opinion Makers Section
Related papers
- Research on Discrete Multi-objective Optimization Problem
- Approaches Used In Adapting Metaheuristic Optimization Algorithms Developed For Continuous Problems to Discrete Problems
- Binary African vultures optimization algorithm for various optimization problems
- A critical review of discrete filled function methods in solving nonlinear discrete optimization problems
- An Optimum Design for Beams with Discrete and Continuous Variables.
- Mixed integer optimization using the quasi-chaotic optimization with the discrete simultaneous perturbation stochastic approximation
- A Modified Jaya Algorithm for Mixed-Variable Optimization Problems
- Hybrid Intelligent Method for Dynamic Reactive Power Optimization
- Mathematical Programming Procedures for Mixed Discrete-Continuous Design Problems,