Pages that link to "Item:Q3885508"
From MaRDI portal
The following pages link to A Survey and Comparison of Methods for Finding All Vertices of Convex Polyhedral Sets (Q3885508):
Displaying 50 items.
- Exact and approximate approaches to the identification of stochastic MAX-plus-linear systems (Q481353) (← links)
- An extreme-point-ranking algorithm for the extreme-point mathematical programming problem (Q580171) (← links)
- Delaunay-based derivative-free optimization via global surrogates. I: Linear constraints (Q727384) (← links)
- Using Gale transforms in computational geometry (Q805285) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- Constructing the set of efficient objective values in multiple objective linear programs (Q918870) (← links)
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm (Q932709) (← links)
- Ranking of vertices in the linear fractional programming problem (Q1053617) (← links)
- Pivoting rules and redundancy schemes in extreme point enumeration (Q1063390) (← links)
- The geometry of certain fixed marginal probability distributions (Q1076460) (← links)
- A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization (Q1102872) (← links)
- A representation of an efficiency equivalent polyhedron for the objective set of a multiple objective linear program (Q1129976) (← links)
- An improved vertex enumeration algorithm (Q1160560) (← links)
- A finite algorithm for solving the generalized lattice point problem (Q1179205) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- A new pivoting rule for solving various degeneracy problems (Q1198621) (← links)
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra (Q1199131) (← links)
- A statistical approach to the analytic hierarchy process with interval judgements. I: Distributions on feasible regions (Q1303711) (← links)
- Selected bibliography on degeneracy (Q1312748) (← links)
- Degeneracy graphs: Theory and applications. An updated survey (Q1312751) (← links)
- Efficient enumeration of the vertices of polyhedra associated with network LP's (Q1315430) (← links)
- Constructing the set of efficient objective values in linear multiple objective transportation problems (Q1328608) (← links)
- Practical issues on the projection of polyhedral sets (Q1356171) (← links)
- A recursive algorithm for volume-based sensitivity analysis of linear decision models (Q1362948) (← links)
- Optimization over the efficient set of a parametric multiple objective linear programming problem (Q1577111) (← links)
- Binomial mixtures: Geometric estimation of the mixing distribution (Q1578284) (← links)
- Obtaining simultaneous solutions of linear subsystems of inequalities and duals (Q1602997) (← links)
- Capturing the essence of a metabolic network: a flux balance analysis approach (Q1625919) (← links)
- An approximation method for computing the expected value of max-affine expressions (Q1662980) (← links)
- Spatial multi-attribute decision analysis: axiomatic foundations and incomplete preference information (Q1711462) (← links)
- Errors bounds for finite approximations of coherent lower previsions on finite probability spaces (Q1726342) (← links)
- Scenario-based portfolio model for building robust and proactive strategies (Q1754078) (← links)
- Reduction techniques for network validation in systems biology (Q1790877) (← links)
- The generalized linear complementarity problem and an algorithm to find all its solutions (Q1802954) (← links)
- Performance of some boundary-seeking mode estimators on the dome bias model (Q1806771) (← links)
- Multiattribute utility functions, partial information on coefficients, and efficient choice (Q1814247) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- An algorithm for a class of nonlinear fractional problems using ranking of the vertices (Q1824995) (← links)
- Efficient solution generation for multiple objective linear programming based on extreme ray generation method (Q1887884) (← links)
- A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem (Q1890947) (← links)
- Properties of least squares estimates in set membership identification (Q1891002) (← links)
- Segments in enumerating faces (Q1904658) (← links)
- Mathematical systems for enhancing diffuse images of point sources (Q1915959) (← links)
- Efficient allocation of resources to a portfolio of decision making units (Q2184153) (← links)
- Bi-objective optimization problems with two decision makers: refining Pareto-optimal front for equilibrium solution (Q2197166) (← links)
- A new algorithm to find all vertices of a polytope (Q2314411) (← links)
- Algorithms to solve some problems of concave programming with linear constraints (Q2371599) (← links)
- Geometry of possibility measures on finite sets (Q2379302) (← links)
