Sufficiency Conditions and a Duality Theory for Mathematical Programming Problems in Arbitrary Linear Spaces

1970 ◽  
pp. 323-348 ◽  
Author(s):  
LUCIEN W. NEUSTADT
Author(s):  
C. H. Scott ◽  
T. R. Jefferson

AbstractRecently we have developed a completely symmetric duality theory for mathematical programming problems involving convex functionals. Here we set our theory within the framework of a Lagrangian formalism which is significantly different to the conventional Lagrangian. This allows various new characterizations of optimality.


1978 ◽  
Vol 100 (3) ◽  
pp. 356-362 ◽  
Author(s):  
S. S. Rao ◽  
S. K. Hati

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