Characterizations of optimality for continuous convex mathematical programs. Part I. Linear constraints

1979 ◽  
Vol 21 (1) ◽  
pp. 37-44 ◽  
Author(s):  
C. H. Scott ◽  
T. R. Jefferson
Keyword(s):  
Mathematical Programming ◽  
Duality Theory ◽  
Linear Constraints ◽  
Lagrangian Formalism ◽  
Symmetric Duality ◽  
Mathematical Programs ◽  
Convex Functionals ◽  
Mathematical Programming Problems

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.

scholarly journals Symmetric duality in complex spaces over cones

2021 ◽  
pp. 4-4
Author(s):  
Izhar Ahmad ◽  
Divya Agarwal ◽  
Kumar Gupta
Keyword(s):  
Mathematical Programming ◽  
Duality Theory ◽  
Optimization Theory ◽  
Second Order ◽  
Symmetric Duality ◽  
Polyhedral Cones ◽  
Complex Spaces ◽  
Duality Results ◽  
Duality Relations

Duality theory plays an important role in optimization theory. It has been extensively used for many theoretical and computational problems in mathematical programming. In this paper duality results are established for first and second order Wolfe and Mond-Weir type symmetric dual programs over general polyhedral cones in complex spaces. Corresponding duality relations for nondifferentiable case are also stated. This work will also remove inconsistencies in the earlier work from the literature.

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