scientific article; zbMATH DE number 4197737

zbMATH Open0725.90056MaRDI QIDQ5202836FDOQ5202836

Authors: Thomas Morin, Theodore B. Trafalis, Shreeram S. Abhyankar 

Publication date: 1990

Title of this publication is not available (Why is that?)

Recommendations

• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
• An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
• Determination of the efficient set in multiobjective linear programming
• Finding all maximal efficient faces in multiobjective linear programming
• Efficiency equivalent polyhedra for the feasible set of multiple objective linear programming

zbMATH Keywords

interior point methodalgebraic surfacemultiple objective optimizationpolynomial timebounded polyhedronset of efficient faces

Mathematics Subject Classification ID

Linear programming (90C05) Multi-objective and goal programming (90C29) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)

Cited In (7)

• Title not available (Why is that?)
• Normal cones to a polyhedral convex set and generating efficient faces in linear multiobjective programming
• Symplectic groups and permutation polynomials. II
• An interactive interior point algorithm for multiobjective linear programming problems
• Analytic centers and repelling inequalities
• Solving a linear multiperiod portfolio problem by interior-point methodology
• Primal-dual simplex method for multiobjective linear programming

This page was built for publication:

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