TITLE

The Emergence of Nonlinear Programming: Interactions between Practical Mathematics

AUTHOR(S)
Kjeldsen, Tinne Hoff
PUB. DATE
June 2000
SOURCE
Mathematical Intelligencer;Summer2000, Vol. 22 Issue 3, p50
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Features the beginning of the modern mathematical theory of nonlinear programming in 1950. Kuhn-Tucker theorem; Mobilization of scientists in the USA during World War II; Practical mathematics; Problem solving to theory; Significance of Office of Naval Research; Nonlinear programming.
ACCESSION #
3404923

 

Related Articles

  • Approximate Solutions of Continuous Dispersion Problems. Dimnaku, Artan; Kincaid, Rex; Trosset, Michael // Annals of Operations Research;Jan2005, Vol. 136 Issue 1-4, p65 

    The problem of positioningppoints so as to maximize the minimum distance between them has been studied in both location theory (as the continuousp-dispersion problem) and the design of computer experiments (as the maximin distance design problem). This problem can be formulated as a nonlinear...

  • Numerical Experiments with a Continuous L2-exponential Merit Function for Semi-Infinite Programming. Pereira, Ana Isabel P. N.; Fernandes, Edite M. G. P. // AIP Conference Proceedings;11/6/2008, Vol. 1060 Issue 1, p11 

    Here, we present some numerical experiments with a reduction method for solving nonlinear semi-infinite programming (SIP) problems. The method relies on a line search technique to ensure a sufficient decrease of a L2-exponential merit function. The proposed merit function is continuous for SIP...

  • STRONGER CUTS IN INTEGER PROGRAMMING. Glover, Fred // Operations Research;Nov/Dec67, Vol. 15 Issue 6, p1174 

    In a recent note ROBERT WILSON [Opns. Res. 15, 155–156 (1967)] shows how to calculate stronger cuts than those proposed by Gomory for his all-integer algorithm. We supplement Wilson's observations by providing a basis for calculating other cuts, drawing on results of GLOVER [Management...

  • Model and extended Kuhn�Tucker approach for bilevel multi-follower decision making in a referential-uncooperative situation. Jie Lu; Chenggen Shi; Guangquan Zhang; Tharam Dillon // Journal of Global Optimization;Aug2007, Vol. 38 Issue 4, p597 

    Abstract��When multiple followers are involved in a bilevel decision problem, the leader�s decision will be affected, not only by the reactions of these followers, but also by the relationships among these followers. One of the popular situations within this bilevel multi-follower...

  • A Mixed Traffic Assignment Problem and Its Upper Bound of Efficiency Loss. Xiao-Jun Yu; Jiancheng Long // Journal of Applied Mathematics;2014, p1 

    A variational inequality (VI) formulation of a mixed traffic assignment problem associated with user equilibrium (UE) player and altruistic players (UE-AP) is developed. The users governed by the UE player use the paths with minimum actual travel cost, while the users governed by altruistic...

  • Hybrid Approach with Active Set Identification for Mathematical Programs with Complementarity Constraints. Lin, G. H.; Fukushima, M. // Journal of Optimization Theory & Applications;Jan2006, Vol. 128 Issue 1, p1 

    We consider a mathematical program with complementarity constraints (MPCC). Our purpose is to develop methods that enable us to compute a solution or a point with some kind of stationarity to MPCC by solving a finite number of nonlinear programs. We apply an active set identification technique...

  • A New Optimization Model for Solving the Constraint Satisfaction Problem. Ettaouil, Mohamed; Loqman, Chakir // Journal of Advanced Research in Computer Science;2009, Vol. 1 Issue 1, p13 

    A constraint satisfaction problem (CSP) involves the assignment of values to variables which are subject to a set of constraints. In this paper, we propose a new modelization of the binary CSP as 0-1 quadratic programming (QP) which consists in minimizing a quadratic function subject to linear...

  • On relaxing the Mangasarian-Fromovitz constraint qualification. Kruger, Alexander; Minchenko, Leonid; Outrata, Jiří // Positivity;Mar2014, Vol. 18 Issue 1, p171 

    For the classical nonlinear program, two new relaxations of the Mangasarian-Fromovitz constraint qualification are discussed and their relationship with some standard constraint qualifications is examined. In particular, we establish the equivalence of one of these constraint qualifications with...

  • Minimizing Completion Time Variance in a Flowshop Scheduling Problem with a Learning Effect. EREN, Tamer // Gazi University Journal of Science;2013, Vol. 26 Issue 3, p389 

    In this paper, flowshop scheduling problem with a learning effect is considered. The objective function of the problem is minimizing completion times variance. A non-linear programming model is developed for the problem. Also the model is tested on an example. Results of computational tests show...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics