A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
From MaRDI portal
Publication:3885508
surveyconvex polytopescomputational resultscomparison of algorithmsconvex polyhedral setsfinding all vertices
Numerical mathematical programming methods (65K05) Linear programming (90C05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Polytopes and polyhedra (52Bxx) Inequalities and extremum problems involving convexity in convex geometry (52A40) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited in
(87)- On minimal generators for semi-closed polyhedra
- Errors bounds for finite approximations of coherent lower previsions on finite probability spaces
- scientific article; zbMATH DE number 3793302 (Why is no real title available?)
- Some applications of combinatorial optimization in parallel computing
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- A statistical approach to the analytic hierarchy process with interval judgements. I: Distributions on feasible regions
- A LIBRARY FOR DOING POLYHEDRAL OPERATIONS
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A state-set estimation algorithm for linear systems in the presence of bounded disturbances
- Practical issues on the projection of polyhedral sets
- Geometry of possibility measures on finite sets
- Which nonnegative matrices are slack matrices?
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program
- A Calculation of all Separating Hyperplanes of two Convex Polytopes
- Traversing combinatorial 0/1-polytopes via optimization
- UNCERTAINTY AND ESTIMATION IN RECONSTRUCTABILITY ANALYSIS
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints
- A recursive algorithm for volume-based sensitivity analysis of linear decision models
- Fourier algorithm revisited
- On-line and off-line vertex enumeration by adjacency lists
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- A penalty method for the identification of nonlinear elliptic differential operator
- Iterative MILP algorithm to find alternate solutions in linear programming models
- A branch and bound algorithm for extreme point mathematical programming problems
- Efficient allocation of resources to a portfolio of decision making units
- The geometry of certain fixed marginal probability distributions
- Degeneracy graphs: Theory and applications. An updated survey
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem
- Mathematical systems for enhancing diffuse images of point sources
- Properties of least squares estimates in set membership identification
- A common formula to compute the efficient sets of a class of multiple objective linear programming problems
- Linear programming in tector criterion markov and semi-Markov decision processes
- Algorithms to solve some problems of concave programming with linear constraints
- An approximation method for computing the expected value of max-affine expressions
- The generalized linear complementarity problem and an algorithm to find all its solutions
- An algorithm for a class of nonlinear fractional problems using ranking of the vertices
- Exact and approximate approaches to the identification of stochastic MAX-plus-linear systems
- Full-low evaluation methods for bound and linearly constrained derivative-free optimization
- A NON-SPECIFICITY MEASURE FOR CONVEX SETS OF PROBABILITY DISTRIBUTIONS
- Reduction techniques for network validation in systems biology
- Separating support hyperplanes for a pair of convex polyhedral sets
- Generation and presentation of nearly optimal solutions for mixed-integer linear programming, applied to a case in faming system design
- A new algorithm to find all vertices of a polytope
- (Deterministic) algorithms that compute the volume of polytopes
- Markov chains with doubly stochastic transition matrices and application to a sequence of non-selective quantum measurements
- A finite algorithm for solving the generalized lattice point problem
- Model predictive control for perturbed max-plus-linear systems
- Selected bibliography on degeneracy
- Extending quantum operations
- Computing low-capacity 0–1 knapsack polytopes
- Performance of some boundary-seeking mode estimators on the dome bias model
- The multidimensional truncated moment problem: Gaussian mixture reconstruction from derivatives of moments
- Segments in enumerating faces
- The design of optimum component test plans in the demonstration of a series system reliability
- Finding and identifying optimal inventory levels for systems with common components
- Ranking of vertices in the linear fractional programming problem
- The polytope of optimal approximate designs: extending the selection of informative experiments
- Optimal scaling of balls and polyhedra
- Capturing the essence of a metabolic network: a flux balance analysis approach
- Binary choice models with discrete regressors: identification and misspecification
- Multiattribute utility functions, partial information on coefficients, and efficient choice
- A finite cutting plane method for facial disjunctive programs
- Constructing the set of efficient objective values in linear multiple objective transportation problems
- Obtaining simultaneous solutions of linear subsystems of inequalities and duals
- A new pivoting rule for solving various degeneracy problems
- Pivoting rules and redundancy schemes in extreme point enumeration
- Bi-objective optimization problems with two decision makers: refining Pareto-optimal front for equilibrium solution
- Using Gale transforms in computational geometry
- Efficient enumeration of the vertices of polyhedra associated with network LP's
- Combinatorial optimization and small polytopes
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- A validation and verification tool for global optimization solvers
- An improved vertex enumeration algorithm
- Binomial mixtures: Geometric estimation of the mixing distribution
- Spatial multi-attribute decision analysis: axiomatic foundations and incomplete preference information
- Scenario-based portfolio model for building robust and proactive strategies
- Bounds on the complexity of halfspace intersections when the bounded faces have small dimension
- Enumerative techniques for solving some nonconvex global optimization problems
- Constructing the set of efficient objective values in multiple objective linear programs
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint
- Ranking and selection for multiple performance measures using incomplete preference information
- Linear dynamics for the state vector of Markov chain functions
- Algorithmic construction of SSA-compatible extreme rays of the subadditivity cone and the N = 6 solution
- Optimal distributions for multiplex logistic networks
- On a calculation of an arbitrary separating hyperplane of convex polyhedral sets
This page was built for publication: A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3885508)
