Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
From MaRDI portal
Publication:1937858
DOI10.1007/s12597-012-0067-4zbMath1256.90028OpenAlexW2054911125MaRDI QIDQ1937858
Publication date: 1 February 2013
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-012-0067-4
Integer programming (90C10) Multi-objective and goal programming (90C29) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (5)
Solving multi-objective integer indefinite quadratic fractional programs ⋮ A note on solving multi-objective integer indefinite quadratic fractional programs ⋮ A branch-bound cut technique for non-linear fractional multi-objective optimization problems ⋮ A taxonomy and review of the multi-objective fractional programming (MOFP) problems ⋮ A cutting plane approach for multi-objective integer indefinite quadratic programming problem
Cites Work
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
- A review of interactive methods for multiobjective integer and mixed-integer programming
- An approach to find redundant objective function(s) and redundant constraint(s) in multi-objective nonlinear stochastic fractional programming problems
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Fractional programming revisited
- Fractional programming: Applications and algorithms
- A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A survey and annotated bibliography of multiobjective combinatorial optimization
- The controlled estimation method in the multiobjective linear fractional problem
- An algorithm for optimizing a linear function over an integer efficient set
- \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
- A Survey of Multiple Criteria Integer Programming Methods
- Multiple Objective Linear Fractional Programming
- Finding all efficient extreme points for multiple objective linear programs
- A revised simplex method for linear multiple objective programs
- Nonlinear Programming
- Solving Bicriterion Mathematical Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Multiobjective integer nonlinear fractional programming problem: a cutting plane approach
