G.J. Still
http://repub.eur.nl/ppl/5617/
List of Publicationsenhttp://repub.eur.nl/eur_logo_new.png
http://repub.eur.nl/
RePub, Erasmus University RepositoryAn elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions in nonlinear programming
http://repub.eur.nl/pub/19255/
Sun, 01 Jul 2007 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
In this note we give an elementary proof of the Fritz-John and Karush–Kuhn–Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints. The proof avoids the implicit function theorem usually applied when dealing with equality constraints and uses a generalization of Farkas lemma and the Bolzano-Weierstrass property for compact sets.Equilibrium constrained optimization problems
http://repub.eur.nl/pub/19277/
Thu, 16 Mar 2006 00:00:01 GMT<div>S.I. Birbil</div><div>G. Bouza</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated KKM lemma, we prove the existence of feasible points for the equilibrium constraints. Moreover, we analyze the topological and analytical structure of the feasible set. Alternative formulations of an equilibrium constrained optimization problem (ECOP) that are suitable for numerical purposes are also given. As an important first step for developing efficient algorithms, we provide a genericity analysis for the feasible set of a particular ECOP, for which all the functions are assumed to be linear.An elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions in nonlinear programming
http://repub.eur.nl/pub/7030/
Mon, 07 Nov 2005 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints.The proof avoids the implicit function theorem usually applied when dealing with equality constraints and uses a generalization of
Farkas lemma and the Bolzano-Weierstrass property for compact sets.An Elementary Proof of the Fritz-John and Karush-Kuhn-Tucker Conditions in Nonlinear Programming
http://repub.eur.nl/pub/6992/
Fri, 14 Oct 2005 00:00:01 GMT<div>S.I. Birbil</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
In this note we give an elementary proof of the Fritz-John and Karush-Kuhn-Tucker conditions for nonlinear finite dimensional programming problems with equality and/or inequality constraints. The proof avoids the implicit function theorem usually applied when dealing with equality constraints and uses a generalization of Farkas lemma and the Bolzano-Weierstrass property for compact sets.A Note on the Dual of an Unconstrained (Generalized) Geometric Programming Problem
http://repub.eur.nl/pub/1927/
Fri, 01 Apr 2005 00:00:01 GMT<div>J.B.G. Frenk</div><div>G.J. Still</div>
In this note we show that the strong duality theorem of an unconstrained (generalized) geometric
programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian
duality result. Contrary to [1] we also consider the case that the set C is compact and convex
and in this case we do not need to assume the standard regularity condition.A note on the dual of an unconstrained (generalized) geometric programming problem
http://repub.eur.nl/pub/19412/
Fri, 01 Apr 2005 00:00:01 GMT<div>J.B.G. Frenk</div><div>G.J. Still</div>
In this note we show that the strong duality theorem of an unconstrained (generalized) geometric
programming problem as defined by Peterson (cf.[1]) is actually a special case of a Lagrangian
duality result. Contrary to [1] we also consider the case that the set C is compact and convex
and in this case we do not need to assume the standard regularity condition.Equilibrium Constrained Optimization Problems
http://repub.eur.nl/pub/1068/
Wed, 03 Dec 2003 00:00:01 GMT<div>S.I. Birbil</div><div>G. Bouza</div><div>J.B.G. Frenk</div><div>G.J. Still</div>
We consider equilibrium constrained optimization problems, which have a general formulationthat encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated K K M lemma, we prove the existence of feasible points for the equilibrium constraints. Moreover, we analyze the topological and analytical structure of the feasible set. Alternative formulations of an equilibrium constrained optimization problem (ECOP) that are suitable for numerical purposes are also given. As an important _rst step for developing ef_cient algorithms, we provide a genericity analysis for the feasible set of a particular ECOP, for which all the functions are assumed to be linear.