Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
From MaRDI portal
Publication:642767
DOI10.1155/2011/464832zbMath1223.90041OpenAlexW2074311097WikidataQ58690431 ScholiaQ58690431MaRDI QIDQ642767
Le Quang Thuy, Nguyen Thi Bach Kim, Nguyen Tuan Thien
Publication date: 27 October 2011
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2011/464832
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for convex multi-objective programming problems
- Finding a minimal efficient solution of a convex multiobjective program
- Homotopy method for a general multiobjective programming problem
- Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
- A global optimization approach for solving the convex multiplicative programming problem
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Finding all maximal efficient faces in multiobjective linear programming
- Generalized convex multiplicative programming via quasiconcave minimization
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
- Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
- Outcome space partition of the weight set in multiobjective linear programming
- Reverse polyblock approximation for generalized multiplicative/fractional programming
- A survey of recent developments in multiobjective optimization
- Finite algorithm for minimizing the product of two linear functions over a polyhedron
- Proper efficiency and the theory of vector maximization
- An Existence Theorem in Vector Optimization
- Minimizing the sum of a convex function and the product of two affine functions over a convex set
- Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
- Convex Analysis
- Normal cone method in solving linear multiobjective problems
This page was built for publication: Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming
