Mixed symmetric duality in nondifferentiable mathematical programming
A mixed symmetric dual formulation is presented for a class of nondifferentiable nonlinear programming problems with multiple arguments. Weak, strong and converse duality theorems are established. The mixed symmetric dual formulation unifies the two existing symmetric dual formulations in the litera...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
Scientific Publishers
2003
|
| Online Access: | http://hdl.handle.net/20.500.11937/36086 |