The following pages link to 10.1007/s11470-008-3004-0 (Q3499922):
Displaying 18 items.
- Equivalence between polyhedral projection, multiple objective linear programming and vector linear programming (Q343821) (← links)
- The geometry of the set of scaled projections (Q686373) (← links)
- On polyhedral projection and parametric programming (Q939122) (← links)
- Solution of projection problems over polytopes (Q1185491) (← links)
- Projecting a simplex onto another one (Q1315378) (← links)
- Inner and outer approximations of polytopes using boxes. (Q1428115) (← links)
- The polyhedral projection problem (Q2304906) (← links)
- Problems related to estimating the coefficients of exact penalty functions (Q2320225) (← links)
- Marginalization like a projection (Q2775911) (← links)
- A note on the dual description of projected polytopes (Q2783492) (← links)
- Polytope Projection and Projection Polytopes (Q2785301) (← links)
- Projection onto a polyhedron that exploits sparsity (Q2817841) (← links)
- Projection of a point onto a polyhedron (Q2838790) (← links)
- Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (Q4558290) (← links)
- An algorithm for projecting onto simplicial cones (Q5151504) (← links)
- Modeling and optimizing large-scale production-level transportation systems (Q5878625) (← links)
- A bicomposition of conical projections (Q6194916) (← links)
- Equivalence relations in convex optimization (Q6644063) (← links)