Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming

DOI10.1155/2011/464832zbMATH Open1223.90041DBLPjournals/jam/ThuyTT11OpenAlexW2074311097WikidataQ58690431 ScholiaQ58690431MaRDI QIDQ642767FDOQ642767

Authors: 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

Recommendations

• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• A convex analysis approach for convex multiplicative programming
• An outcome space approach for generalized convex multiplicative programs
• Outcome space algorithm for generalized multiplicative problems and optimization over the efficient set
• Multiplicative programming problems: Analysis and efficient point search heuristic

Mathematics Subject Classification ID

Convex programming (90C25) Multi-objective and goal programming (90C29)

Cites Work

• Convex Analysis
• Multiple-criteria decision making. Concepts, techniques, and extensions. With the assistance of Yoon-Ro Lee and Antonie Stam
• Title not available (Why is that?)
• Proper efficiency and the theory of vector maximization
• A survey of recent developments in multiobjective optimization
• 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
• Outcome space partition of the weight set in multiobjective linear programming
• An Existence Theorem in Vector Optimization
• Scalarizing Functions for Generating the Weakly Efficient Solution Set in Convex Multiobjective Problems
• A global optimization approach for solving the convex multiplicative programming problem
• Normal cone method in solving linear multiobjective problems
• Generalized convex multiplicative programming via quasiconcave minimization
• Finding a minimal efficient solution of a convex multiobjective program
• Homotopy method for a general multiobjective programming problem
• An approximation algorithm for convex multi-objective programming problems
• Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• Reverse polyblock approximation for generalized multiplicative/fractional programming
• Finite algorithm for minimizing the product of two linear functions over a polyhedron
• Generating all efficient extreme solutions in multiple objective linear programming problem and its application to multiplicative programming
• Title not available (Why is that?)
• Minimizing the sum of a convex function and the product of two affine functions over a convex set
• Outcome-space outer approximation algorithm for linear multiplicative programming

Cited In (3)

• Solving generalized convex multiobjective programming problems by a normal direction method
• A novel convex relaxation-strategy-based algorithm for solving linear multiplicative problems
• A global optimization approach for generating efficient points for multiobjective concave fractional programs

This page was built for publication: Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q642767)