On the application of the flexible polyhedron method to solve mathematical programming problems

1995 ◽  
Vol 73 (5) ◽  
pp. 535-537
Author(s):  
A. I. Vafina ◽  
V. R. Fazylov
Keyword(s):  
Mathematical Programming ◽  
Flexible Polyhedron ◽  
Mathematical Programming Problems ◽  
Polyhedron Method

A Hybrid Algorithm for Solving Polynomial Zero-One Mathematical Programming Problems

1990 ◽  
Vol 22 (2) ◽  
pp. 161-167 ◽  
Author(s):  
WALTER S. SNYDER ◽  
JAMES W. CHRISSIS
Keyword(s):  
Mathematical Programming ◽  
Hybrid Algorithm ◽  
Polynomial Zero ◽  
Mathematical Programming Problems

Iterative algorithm for mathematical programming problems with preconvex constraints

2010 ◽  
Vol 50 (5) ◽  
pp. 792-794 ◽  
Author(s):  
T. F. Minnibaev ◽  
Yu. A. Chernyaev
Keyword(s):  
Mathematical Programming ◽  
Iterative Algorithm ◽  
Mathematical Programming Problems

Computerized Selection of Optimum Machining Conditions for a Job Requiring Multiple Operations

1978 ◽  
Vol 100 (3) ◽  
pp. 356-362 ◽  
Author(s):  
S. S. Rao ◽  
S. K. Hati
Keyword(s):  
Nonlinear Programming ◽  
Mathematical Programming ◽  
Machine Tools ◽  
Machining Conditions ◽  
Coupling Constraints ◽  
Programming Techniques ◽  
Mathematical Programming Problems ◽  
The Individual ◽  
The Cost ◽  
Selection Of

The problem of determining the optimum machining conditions for a job requiring multiple operations has been investigated. Three objectives, namely, the minimization of the cost of production per piece, the maximization of the production rate and, the maximization of the profit are considered in this work. In addition to the usual constraints that arise from the individual machine tools, some coupling constraints have been included in the formulation. The problems are formulated as standard mathematical programming problems, and nonlinear programming techniques are used to solve the problems.

Sign in / Sign up

Export Citation Format

Share Document