On a variant lexicographic multi-objective programming
Article Abstract:
An algorithm developed using a variant of lexicographic multi-objective programming exhibits the classical lexicographic minimization which allows for the solution of convex programs. The mathematical basis for the minimization is explained, clarifying the basis of the commands contained in the algorithm.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Optimality and duality in nonlinear programming involving semilocally B-preinvex and related functions
Article Abstract:
Variability of problems concerning mathematical programming models, under semilocally B-preinvex functions, is examined.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2006
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Dynamic multiple responses by ideal solution analysis. Technical note - on optimization approach for multidisk vertical allocation problems
- Abstracts: Predation due to adverse selection in financial markets. Nonlinear price discrimination with a finite number of consumers and constrained recontracting
- Abstracts: Nature of the relationship between international expansion and performance: the case of emerging market firms
- Abstracts: Dynamic duopoly with congestion effects. Infant-industry tariff protection with pressure groups. Two-part tariff competition in duopoly
- Abstracts: A model of price promotions with consumer search. Differentiation and discrimination in a duopoly with two bundles