Pseudo-invexity and duality in nonlinear programming

Article Abstract:

Four dual problems in nonlinear programming for pseudo-invex functions are examined. Weak and strong duality theorems for different non-convex conditions with arbitrary cones were analyzed. The problems are similar to the problems for non-negative variables of Mond and Weir, who suggested several duals to the nonlinear programming problem under different generalized convexity conditions in 1981.

Models, Analysis, Nonlinear programming, Convex domains

---

Symmetric dual multiobjective programming

Article Abstract:

The vector-valued SPV and SDV problems were defined as a pair of dual symmetric multiobjective programming problems under various convexity assumptions to fill a gap in the literature on symmetric duality in nonlinear programming. Their formulation resulted in the strong and weak duality theorems for pseudo-convex and pseudo-concave functions .

Operations Research, Case studies, Optimization theory, Mathematical programming

---

Symmetric duality with pseudo-invexity in variational problems

Article Abstract:

A new study applies pseudo-invexity to symmetric dual variational problems, Special cases include static dual programs and self-dual problems.

Usage, Nonlinear theories

Similar abstracts:

• Abstracts: Drinks all round. Pulp fiction: high newspaper prices mean little to Korean producers. Interior motives: architect ushers plants and light into Seoul's concrete jungle
• Abstracts: Heuristics and exact algorithms for solving the Monden problem. Exact and heuristic algorithms for data sets reconstruction
• Abstracts: The right and its wrongs: fringe rightist groups crave attention
• Abstracts: Project management and scheduling. Analysis of approximation algorithms for single-machine scheduling with delivery times and sequence independent batch setup times
• Abstracts: Optimal expansion of capacitated transshipment networks. Unconstrained Quadatric Bivalent Programming Problem

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.