EFFACET

swMATH14800MaRDI QIDQ26697FDOQ26697

Author name not available (Why is that?)

Cited In (7)

• Random problem genertion and the computation of efficient extreme points in multiple objective linear programming
• A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
• A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems
• Computational experience concerning payoff tables and minimum criterion values over the efficient set
• Title not available (Why is that?)
• A combined constraint-space, objective-space approach for determining high-dimensional maximal efficient faces of multiple objective linear programs
• A bookkeeping strategy for multiple objective linear programs

This page was built for software: EFFACET