Finding the insphere of a convex polyhedron: an analytical approach

ISSN： 1478-6443

Source： Philosophical Magazine, Vol.84, Iss.12, 2004-04, pp. : 1185-1196

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Light-Sources That Illuminate the Boundary Points All But the Vertices of a Convex Polyhedron

By Bezdek K.

Periodica Mathematica Hungarica, Vol. 34, Iss. 1-2, 1997-05 ,pp. : 17-21

Springer Publishing Company

Access to resources Recommend Favorite

Finding a Minimal Efficient Solution of a Convex Multiobjective Program

By Lin Z.H. Zhu D.L. Sheng Z.P.

Journal of Optimization Theory and Applications, Vol. 118, Iss. 3, 2003-09 ,pp. : 587-600

Springer Publishing Company

Access to resources Recommend Favorite

Piecewise convex maximization approach to multiknapsack

By Fortin Dominique

Optimization, Vol. 58, Iss. 7, 2009-10 ,pp. : 883-895

Taylor & Francis Ltd

Access to resources Recommend Favorite

Concave programming for finding sparse solutions to problems with convex constraints

By Rinaldi F.

Optimization Methods and Software, Vol. 26, Iss. 6, 2011-12 ,pp. : 971-992

Taylor & Francis Ltd

Access to resources Recommend Favorite

Some Analytical Properties of γ-Convex Functions in Normed Linear Spaces

By Phu H. Hai N.

Journal of Optimization Theory and Applications, Vol. 126, Iss. 3, 2005-09 ,pp. : 685-700

Springer Publishing Company

Access to resources Recommend Favorite