Implementation of the nonlinear programming algorithm when optimizing the final turning mode

For computer-aided multi-variant design of machining technologies, it is important to optimize the cutting parameters at the final pass in each technological operation. When carrying out designing procedures, there emerge problems relating to the algorithm of choosing the decision-making method, the...

Full description

Saved in:
Bibliographic Details
Published in:IOP conference series. Materials Science and Engineering Vol. 862; no. 3; pp. 32009 - 32015
Main Authors: Galkin, M G, Smagin, A S
Format: Journal Article
Language:English
Published: Bristol IOP Publishing 01.05.2020
Subjects:
Algorithms
CAD
Computer aided design
Cutting parameters
Cutting tools
Decision making
Lagrange multiplier
Linear programming
Nonlinear programming
Optimization
Turning (machining)
ISSN:1757-8981, 1757-899X
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For computer-aided multi-variant design of machining technologies, it is important to optimize the cutting parameters at the final pass in each technological operation. When carrying out designing procedures, there emerge problems relating to the algorithm of choosing the decision-making method, the objective function, and the regions of feasibility at final machining steps. Linear programming is time-consuming for multi-variant and multi-pass machining, if the algorithm is to be clear. It is known that when simulating the optimal metal-cutting process, the optimization criterion and the system of constraints are non-linear. Therefore, a computational algorithm can be made significantly more efficient if it is a non-linear algorithm based on Lagrange multipliers Such approach to design helps simplify automating the computational algorithm for multi-pass single-tool machining with a precision cutting tool (a reamer) This is the method discussed herein.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1757-8981
1757-899X
DOI:10.1088/1757-899X/862/3/032009