Citations with the tag: PROGRAMMING (Mathematics)

Results 1 - 50

• ON LIPSCHITZIAN STABILITY OF OPTIMAL SOLUTIONS OF PARAMETRIZED SEMI-INFINITE PROGRAMS.
  Shapiro, Alexander // Mathematics of Operations Research; Aug94, Vol. 19 Issue 3, p743 

  Studies the continuity properties of optimal solutions of parametrized semi-infinite programming problems. Lipschitzian stability of optimal solutions under cone constraints; Stability of optimal solutions of the semi-infinite programs.

• RESOLVING SCHEDULE FAILURES IN MULTI-MODAL TRANSPORT NETWORKS FOR MOVEMENT OF TIME-SENSITIVE SHIPMENTS.
  Smith, David G. // Journal of Marketing Theory & Practice; Spring94, Vol. 2 Issue 2, p28 

  Focuses on the resolving of schedule failures in multi-modal transport networks of time-sensitive shipments in Virginia. Application of mathematical programming algorithm in the method; Determination of feasible capacity adjustments and rapid communication; Provision of decision support system.

• A Survey of Mathematical Programming Applications in Integrated Steel Plants.
  Dutta, Goutam; Fourer, Robert // Manufacturing & Service Operations Management; Fall2001, Vol. 3 Issue 4, p387 

  Deals with a study which discussed mathematical programming techniques used in the steel industry in 1958. Overview of an integrated steel plant; Description of national steel-planning models; Problem determination through product-mix optimization models.

• Use of Representative Operation Counts in Computational Testing of Algorithms.
  Ahuja, Ravindra K.; Orlin, James B. // INFORMS Journal on Computing; Summer96, Vol. 8 Issue 3, p318 

  Illustrates the notion of representative operation counts that can complement the conventional central processing unit time analysis of algorithms. Identification of asymptotic bottleneck operations in algorithm; Running time of algorithms for different problem sizes.

• Stochastic Programming Computation and Applications.
  Birge, John R. // INFORMS Journal on Computing; Spring97, Vol. 9 Issue 2, p111 

  Describes the basic methodology for stochastic programming models, developments in computation and several practical applications. Brief overview of stochastic programs and simplest formulations; Description of various solution techniques and their computational implementations; Sample of...

• Foreword.
  Powell, Michael; N�rsett, Syvert; McLachlan, Robert; Munthe-Kaas, Hans; Quispel, Reinout; Zanna, Antonella // Foundations of Computational Mathematics; Jun2008, Vol. 8 Issue 3, p287 

  A foreword to "Foundations of Computational Mathematics" is presented.

• ON THE RELATION BETWEEN THE TRAVELING-SALESMAN AND THE LONGEST-PATH PROBLEMS.
  Hardgrave, William W.; Nemhauser, George L. // Operations Research; Sep/Oct62, Vol. 10 Issue 5, p647 

  The main result of this paper is that the traveling-salesman problem is a special case of the longest-path problem Two formulations of the traveling-salesman problem are considered, the version in which the salesman visits each city exactly once and the more general formulation in which each...

• Doing the Hard Things.
  Nelson, Rick // EE: Evaluation Engineering; Oct2011, Vol. 50 Issue 10, p4 

  An introduction to the journal is presented in which the editor discusses various articles published within the issue including one by Tom Lecklider on wireless test, another by Michael J. Smith on device programming, and still another by Dennis Handlon on electromagnetic compatibility (EMC) test.

• Conditioning of semidefinite programs.
  Nayakkankuppam, Madhu V.; Overton, Michael L. // Mathematical Programming; 1999, Vol. 85 Issue 3, p525 

  Abstract. This paper studies the conditioning of semidefinite programs by analyzing the effect of small perturbations in problem data on the solution. Under the assumptions of strict complementarity and nondegeneracy, an explicit bound on the change in the solution is derived in a primal-dual...

• The core and nucleolus of games: A note on a paper by G�the-Lundgren et al.
  Chardaire, Pierre // Mathematical Programming; 2001, Vol. 90 Issue 1, p147 

  Abstract. In the paper "On the nucleolus of the basic vehicle routing game", Mathematical Programming 72, 83-100 (1996), Gothe-Lundgren et al. develop a constraint generation method to compute the pre-nucleolus of a game. Their method assumes that constraints that are redundant in the...

• The many facets of linear programming.
  Todd, Michael J. // Mathematical Programming; 2002, Vol. 91 Issue 3, p417 

  We examine the history of linear programming from computational, geometric, and complexity points of view, looking at simplex, ellipsoid, interior-point, and other methods.

• Foreword: special issue on mathematical programming in biology and medicine.
  Ferris, Michael C.; Yin Zhang // Mathematical Programming; Nov2004, Vol. 101 Issue 2, p297 

  Introduces a series of articles on mathematical programming in biology and medicine.

• Foreword: Special issue on nonlinear convex optimization and variational inequalities.
  Attouch, Hedy; Cominetti, Roberto; Teboulle, Marc // Mathematical Programming; Jan2009, Vol. 116 Issue 1/2, p1 

  A foreword to the January 1, 2009 issue of "Mathematical Programming" is presented.

• Bilevel programming with knapsack constraints.
  Dempe, Stephan; Richter, Katrin // Central European Journal of Operations Research; 2000, Vol. 8 Issue 2, p93 

  A special class of bilevel programming problems with discrete parametric lower level problems is considered. First, necessary and sufficient conditions for the existence of optimal solutions are given. Then, a pseudopolynomial exact and a polynomial approximate algorithms for solving the bilevel...

• Benders decomposition for multiobjective programs with cone inclusions.
  Csergoffy, Tibor // Central European Journal of Operations Research; 2001, Vol. 9 Issue 3, p267 

  Shows a generalization of Benders decomposition method for multiobjective programs that contain cone inclusions as constraints. Concept of Pareto optimality; Theory of multiobjective programming.

• A survey on stochastic location and routing problems.
  Kenyon, Astrid S.; Morton, David P. // Central European Journal of Operations Research; 2001, Vol. 9 Issue 4, p277 

  Focuses on mathematical programming models for the location and routing problems where the customer demands are random parameters and the arrival time of the demand is known. Methods used to handle uncertainty in the parameters of a problem; Properties of stochastic linear programming and...

• OPTIMAL PLANS FOR DYNAMIC PROGRAMMING PROBLEMS.
  Himmelberg, C.J.; Parthasarathy, I.; VanVleck, E.S. // Mathematics of Operations Research; Nov76, Vol. 1 Issue 4, p390 

  It is proved that there exist stationary optimal plans for discounted dynamic programming problems, and that there exist semi-Markov e-optimal plans for positive dynamic programming problems. The actions are required to be taken in a variable action set F(s) and the reward function r(s,a) is a...

• APPROXIMATIONS OF DYNAMIC PROGRAMS, II.
  Whitt, Ward // Mathematics of Operations Research; May79, Vol. 4 Issue 2, p179 

  This paper extends a procedure for approximating dynamic programs due to Fox (1971). Here, the monotone contraction operator model of Denardo (1967) is approximated by replacing; the state space with a subset and defining two approximate local income functions so that the two associated...

• A CONICAL ALGORITHM FOR GLOBALLY MINIMIZING A CONCAVE FUNCTION OVER A CLOSED CONVEX SET.
  Tuy, H.; Thieu, T. V.; Thai, Ng. Q. // Mathematics of Operations Research; Aug85, Vol. 10 Issue 3, p498 

  Presents a study that developed a method to solve the problem of finding the global minimum of a concave function over a closed convex set. Background on concave programming; Overview of the method; Details on the convergence condition in concave programming.

• A NOTE ON POSITIVE DYNAMIC PROGRAMMING.
  Van Dawen, Rolf // Mathematics of Operations Research; May86, Vol. 11 Issue 2, p383 

  This note considers total reward Markov decision processes with countable state space. For these models it is well known that in the positive case, i.e. the immediate reward function is nonnegative, without further conditions (1) the value iteration holds and (2) there exist pointwise good...

• LINEAR STATIONARY POINT PROBLEMS ON UNBOUNDED POLYHEDRA.
  Dai, Yang; Talman, Dolf // Mathematics of Operations Research; Aug93, Vol. 18 Issue 3, p635 

  Proposes a complementary pivoting algorithm for finding a stationary point of an affine function on an unbounded polyhedron. Existence of a piecewise linear path from an arbitrarily chosen point in the polyhedron.

• ERRATUM: CAPACITATED FACILITY LOCATION: VALID INEQUALITIES AND FACETS.
  Dai, Yang; Talman, Dolf // Mathematics of Operations Research; Feb96, Vol. 21 Issue 1, p253 

  Presents several corrections to the article "Capacitated Facility Location: Valid Inequalities and Facets," that was published in the Vol. 20, No. 3 issue of "Mathematics of Operations Research."

• PRIMAL-DUAL AFFINE-SCALING ALGORITHMS FAIL FOR SEMIDEFINITE PROGRAMMING.
  Muramatsu, Masakazu; Vanderbei, Robert J. // Mathematics of Operations Research; Feb99, Vol. 24 Issue 1, p149 

  In this paper, we give an example of a semidefinite programming problem in which primal-dual affine-scaling algorithms using the HRVW/KSH/M, MT, and AHO directions fail. We prove that each of these algorithms can generate a sequence converging to a non-optimal solution and that, for the AHO...

• Insights Into Gender Discrimination In Employment Compensation Through The Use Of Classification Models.
  Loucopoulos, Constantine; Pavur, Robert; Gutierrez, Charletta F. // Journal of Managerial Issues; Fall2002, Vol. 14 Issue 3, p375 

  Presents a study which introduced mathematical programming-based classification models as an application to the gender discrimination problem. Classification models; Classificatory performance of models; Conclusion.

• Development of statistical discriminant mathematical programming model via resampling estimation...
  Ziari, Houshmand A.; Leatham, David J.; Ellinger, Paul N. // American Journal of Agricultural Economics; Nov97, Vol. 79 Issue 4, p1352 

  Highlights a study which developed a statistical mathematical programming model, using resampling estimation techniques, in order to solve discriminant analysis problems. Identification of a mathematical programming problem; Information on bootstrap and jackknife techniques; Details on...

• A Comparison of Generating Techniques and Goal Programming for Public Investment, Multiple Objective Decision Making.
  Willis, C.E.; Perlack, R.D. // American Journal of Agricultural Economics; Feb80, Vol. 62 Issue 1, p66 

  The move toward public decision making based on multiple objective analysis has occurred largely during the past decade. During this brief interval dozens of techniques have been advanced for this purpose. The class of (generating) techniques which do not require prior articulation of...

• Price Endogenous Mathematical Programming As a Tool for Sector Analysis.
  McCarl, Bruce A.; Spreen, Thomas H. // American Journal of Agricultural Economics; Feb80, Vol. 62 Issue 1, p87 

  The question, "Why use a mathematical programming model at the sectoral level?" is addressed. To address this question, discussion is presented mathematically and verbally upon mathematical programming sector models in which both price and quantity are endogenous variables. The discussion covers...

• Goal Programming via Multidimensional Scaling Applied to Senegalese Subsistence Farming: Reply.
  McCarl, Bruce A.; Blake, Brian F. // American Journal of Agricultural Economics; Nov83, Vol. 65 Issue 4, p832 

  Addresses comments on a study which proposed a goal programming model for Senegalese farming. Comments on the proposed definitions; Explanation on the concepts of goals and objectives of the model; Discussion on pessimistic aspiration levels and the possibility of dominated solutions in the...

• Constraints Partitioning and Variable Elimination in Goal Programming.
  Selim, Shokri Z.; Rifai, Ahmed K. // Industrial Management; Sep/Oct82, Vol. 24 Issue 5, p1 

  Examines the effective technique in dealing with large problems of goal programming. Extension of linear programming; Maximization of the profit and costs; Inclusion of the constant partitioning algorithm.

• Integrating Agri�Environmental Programs into Regional Production Models: An Extension of Positive Mathematical Programming.
  R�hm, O.; Dabbert, S. // American Journal of Agricultural Economics; Feb2003, Vol. 85 Issue 1, p254 

  Positive Mathematical Programming (PMP) has become a popular method for regional production models. The standard approach estimates cost (or production) functions for each land�use activity separately from each other. This means that the same crop grown under two technologies is treated as if...

• DETERMINISTIC EQUIVALENTS FOR OPTIMIZING AND SATISFICING UNDER CHANCE CONSTRAINTS.
  Charnes, A.; Cooper, W.W. // Operations Research; Jan/Feb63, Vol. 11 Issue 1, p18 

  Discusses deterministic equivalents in the form of specified convex programming problems under chance constraints. Linear decision rules under the maximum expected value, minimum variance and maximum probability; Chance constrained programming.

• MARKOV-RENEWAL PROGRAMMING. I: FORMULATION, FINITE RETURN MODELS.
  Jewell, William S. // Operations Research; Nov/Dec63, Vol. 11 Issue 6, p938 

  Part I. Describes the properties of Markov-renewal processes, the reward structure and the decision process. Dynamic programming; Problem of making decisions at each transition to maximize the total expected reward at the end of the planning horizon.

• MARKOV-RENEWAL PROGRAMMING. II: INFINITE RETURN MODELS, EXAMPLE.
  Jewell, William S. // Operations Research; Nov/Dec63, Vol. 11 Issue 6, p949 

  Part II. Discusses a Markov-renewal programming study which investigates the models that have infinite return. Intervals between transitions of a system from state i to state j are independent samples from a distribution that may depend upon both i and j; Decision mechanism that influences...

• COMMENTS ON AGGARWAL'S PAPER, "A SIMPLEX TECHNIQUE FOR A PARTICULAR CONVEX PROGRAMMING PROBLEM"
  Mylander, W. Charles // CORS Journal; Nov66, Vol. 4 Issue 3, p172 

  Presents a letter to the editor in response to a simplex technique for a particular convex programming problem.

• SEEMINGLY UNRELATED REGRESSION AND REGIONAL PRICE RESPONSE FUNCTIONS: A STUDY OF U.S. APPLE PRODUCTION.
  Miller, Jon R. // Southern Economic Journal; Jul76, Vol. 43 Issue 1, p804 

  The theoretical and empirical work presented in this paper yields two types of results; one set of results involves the general applicability of the methodology, and the other concerns specific conclusions about a particular industry, apple production. At the outset, the popularity of...

• Programmed Learning: Some Non-Confirming Results.
  Whitlock, Gerald H. // Training & Development Journal; Jun67, Vol. 21 Issue 6, p11 

  Examines the basic assumptions underlying linear programming. Material is broken into small steps or frames; Student actively responding to each frame; Student receiving immediate knowledge of results; Assumption that the student is always right and the student proceeds at his own pace.

• Introduction to the Special Issue on the Practice of Mathematical Programming.
  Murphy, Frederic H. // Interfaces; Jul/Aug90, Vol. 20 Issue 4, p1 

  Introduces a series of articles on mathematical programming.

• Optimization and insight by geometric programming.
  Duffin, R. J.; Peterson, E. L. // Journal of Applied Physics; 9/15/1986, Vol. 60 Issue 6, p1860 

  Discusses the main ideas of geometric programming via elementary examples drawn from engineering design, operations research, chemical equilibrium, entropy maximization and statistical inference. Computational approach; General theory of geometric programming.

• Matrix Sensitivity Analysis from an Interior Solution of a Linear Program.
  Greenberg, Harvey J. // INFORMS Journal on Computing; Summer99, Vol. 11 Issue 3, p316 

  This article considers the effect of changing matrix coefficients in a linear program after we have obtained an interior solution. Changes are restricted to where there remains an optimal solution to the perturbed problem (called "admissible"). Mills' minimax theorem provides one approach and...

• Preprocessing and Probing Techniques for Mixed Integer Programming Problems.
  Savelsbergh, M.W.P. // ORSA Journal on Computing; Fall94, Vol. 6 Issue 4, p445 

  In the first part of the paper, we present a framework for describing basic techniques to improve the representation of a mixed integer programming problem. We elaborate on identification of infeasibility and redundancy, improvement of bounds and coefficients, and fixing of binary variables, in...

• Preface.
  Iusem, Alfredo N.; Lucena, Abilio; Maculan, Nelson // Mathematical Programming; Mar2008, Vol. 112 Issue 1, p1 

  A preface for the September 15, 2007 issue of "Mathematical Programming" is presented.

• Preface.
  Anitescu, Mihai; Fourer, Robert // Mathematical Programming; Oct2010, Vol. 125 Issue 2, p205 

  A preface to the book "Mathematical Programming" is presented.

• Editor's Preface.
  Vershik, A. M. // Journal of Mathematical Sciences; Mar2006, Vol. 133 Issue 4, p1379 

  The article presents an introduction to the papers in this issue which focus on the contributions of L. V. Kantorovich in computational mathematics.

• Errata.
  Vershik, A. M. // Management Science; Jun68, Vol. 14 Issue 10, pB-643 

  A correction to the article "A Goal Programming Model for Media Planning," by A. Charnes, W.W. Cooper, J.K. DeVoe, D.B. Learner and W. Reinecke, published in the April 1968 issue, is presented.

• A NON-NUMERICAL APPROACH TO PRODUCTION SCHEDULING PROBLEMS.
  Akers Jr., Sheldon B.; Friedman, Joyce // Journal of the Operations Research Society of America; Nov55, Vol. 3 Issue 4, p429 

  In a typical production scheduling problem, n parts must be fabricated using m machines, and each part must be fabricated in a given order on the machines. It is desired to schedule the parts so that the program is optimal with respect to some given criteria. In general, (n!)[SUPm] programs must...

• Upper and lower bounds of the solution for an elliptic plate problem using a genetic algorithm.
  Lee, Z.-Y.; Chen, C.-K.; Hung, C.-I. // Acta Mechanica; 2002, Vol. 157 Issue 1-4, p201 

  This paper presents a new method of treating engineering problems, in which Mathematical Programming is combined with the Method of Weighted Residual (MWR), and is, therefore, referred to as Mathematical Programming MWR (MP-MWR). If a solution Z(x) exists in the defining domain V of a problem,...

• Special issue of the ISMP 2012 in Berlin.
  Hinterm�ller, Michael; Skutella, Martin // Mathematical Programming; Aug2012, Vol. 134 Issue 1, p1 

  A preface to the special issue of "Mathematical Programming" on the 21st International Symposium on Mathematical Programming (ISMP) which took place in Berlin, Germany is presented.

• Preface.
  Anstreicher, Kurt M.; Freund, Robert M. // Annals of Operations Research; 1996, Vol. 62 Issue 1-4, preceding p1 

  The article discusses various reports published within the issue, including one by Karmarkar on interior point methods and another one by Todd and Ye on lower bound analysis.

• Preface.
  J�nger, Michael; Schultz, R�diger; Weismantel, Robert // Mathematical Methods of Operations Research; 2002, Vol. 56 Issue 1, p1 

  Introduces a series of articles which focused on combinatorial and integer programming.

• GLOBAL CONVERGENCE AND IMPLEMENTATION OF NGTN METHOD FOR SOLVING LARGE-SCALE SPARSE NONLINEAR PROGRAMMING PROBLEMS.
  Qin Ni // Journal of Computational Mathematics; Jul2001, Vol. 19 Issue 4, p337 

  Presents a study which proposed an NGTN method for solving nonlinear programming problems. Construction of the NGTN algorithm; Global convergence of NGTN; Implementation and numerical results of NGTN.

Next 50 Results