Using multiobjective optimization to map the entropy region
From MaRDI portal
Recommendations
- An entropy target-point approach to multiobjective programming
- scientific article; zbMATH DE number 912669
- Multiplicative algorithms with \(p\)-active variables for entropy maximization of polyhedra
- An efficient computational procedure for solving entropy optimization problems with infinitely many linear constraints
- An interval entropy method for equality constrained multiobjective optimization problems
Cites work
- A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
- A new class of non-Shannon-type inequalities for entropies
- An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Balanced information inequalities
- Benson type algorithms for linear vector optimization and applications
- Book Inequalities
- Conditional Independences among Four Random Variables I
- Geometric Duality in Multiple Objective Linear Programming
- Graph Guessing Games and Non-Shannon Information Inequalities
- How good are convex hull algorithms?
- scientific article; zbMATH DE number 2150792 (Why is no real title available?)
- Networks, Matroids, and Non-Shannon Information Inequalities
- On characterization of entropy function via information inequalities
- Recent progresses in characterising information inequalities
- Secret-Sharing Schemes: A Survey
- Two Constructions on Limits of Entropy Functions
Cited in
(9)- Solving DC programs with a polyhedral component utilizing a multiple objective linear programming solver
- The polyhedral projection problem
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- Branch-and-bound and objective branching with three or more objectives
- A Benson-type algorithm for bounded convex vector optimization problems with vertex selection
- A parametric simplex algorithm for linear vector optimization problems
- Geometric Duality Results and Approximation Algorithms for Convex Vector Optimization Problems
- Computing the recession cone of a convex upper image via convex projection
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
This page was built for publication: Using multiobjective optimization to map the entropy region
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963309)
