Mathematical Programming Methods For Constrained Optimization: Dual Methods

1993 ◽  
pp. 123-150 ◽  
Keyword(s):  
Mathematical Programming ◽  
Constrained Optimization ◽  
Dual Methods

scholarly journals Continuous programming containing arbitrary norms

1985 ◽  
Vol 39 (1) ◽  
pp. 28-38 ◽  
Author(s):  
S. Chandra ◽  
B. D. Craven ◽  
I. Husain
Keyword(s):  
Mathematical Programming ◽  
Constrained Optimization ◽  
Optimality Conditions ◽  
Duality Result ◽  
Duality Results ◽  
Continuous Programming ◽  
Arbitrary Norms ◽  
Abstract Spaces ◽  
Special Case

AbstractOptimality conditions and duality results are obtained for a class of cone constrained continuous programming problems having terms with arbitrary norms in the objective and constraint functions. The proofs are based on a Fritz John theorem for constrained optimization in abstract spaces. Duality results for a fractional analogue of such continuous programming problems are indicated and a nondifferentiable mathematical programming duality result, not explicitly reported in the literature, is deduced as a special case.

Sign in / Sign up

Export Citation Format

Share Document