✦ LIBER ✦

On a constraint qualification in a nondifferentiable programming problem

✍ Scribed by Bertram Mond; Murray Schechter

Publisher: John Wiley and Sons
Year: 1976
Tongue: English
Weight: 169 KB
Volume: 23
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800230405

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On constraint qualifications in nonlinea

On constraint qualifications in nonlinear programming

✍ J. P. Evans 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB

Duality for a Class of Nondifferentiable

Duality for a Class of Nondifferentiable Multiobjective Programming Problems

✍ Xin Min Yang; Kok Lay Teo; Xiao Qi Yang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 64 KB

In this paper, both the Wolfe type and Mond᎐Weir type dual problems for a class of nondifferentiable multiobjective programs in which every component of the objective function contains a term involving the support function of a compact convex set are formulated. Weak duality theorems are established

Duality in Nondifferentiable Vector Prog

Duality in Nondifferentiable Vector Programming

✍ R. Osuna-Gómez; A. Rufián-Lizana; P. Ruı́z-Canales 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 108 KB

In this paper we study the saddle point optimality conditions and Lagrange duality in multiobjective optimization for generalized subconvex-like functions. We obtain results which will allow us to characterize the solutions for multiobjective programming problems from the saddle point conditions and

On a certain problem in linear programmi

On a certain problem in linear programming

✍ R. J. Taylor; S. P. Thompson 📂 Article 📅 1958 🏛 John Wiley and Sons 🌐 English ⚖ 474 KB

On a stochastic bilevel programming prob

On a stochastic bilevel programming problem

✍ Stefanie Kosuch; Pierre Le Bodic; Janny Leung; Abdel Lisser 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

## Abstract In this article, a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level is proposed. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a s

Integrating constraint logic programming

Integrating constraint logic programming and operations research techniques for the Crew Rostering Problem

✍ A. Caprara; F. Focacci; E. Lamma; P. Mello; M. Milano; P. Toth; D. Vigo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB

In this paper, we investigate the possibility of integrating Artificial Intelligence (AI) and Operations Research (OR) techniques for solving the Crew Rostering Problem (CRP). CRP calls for the optimal sequencing of a given set of duties into rosters satisfying a set of constraints. The optimality c