Learn More
The models described in this paper for treating congestion in DEA are extended by according them chance constrained programming formulations. The usual route used in chance constrained programming is followed here by replacing these stochastic models with their ''deterministic equivalents.'' This leads to a class of non-linear problems. However, it is shown(More)
Sculptured surfaces are usually machined to their final shapes by a series of rough and finish passes. After each pass, excess material may be left at some concave or C1 discontinuous areas. Traditionally these undercut areas are " cleaned up " by repeatedly machining the whole surface with progressively smaller cutting tools. We present an algorithm for(More)
  • 1