Now showing items 121-123 of 372

    • Analyzing Multi-Objective Linear and Mixed Integer Programs by Lagrange Multipliers 

      Ramakrishnan, V. S.; Shapiro, Jeremy F., 1939- (Massachusetts Institute of Technology, Operations Research Center, 1991-08)
      A new method for multi-objective optimization of linear and mixed programs based on Lagrange multiplier methods is developed. The method resembles, but is distinct from, objective function weighting and goal programming ...
    • On the Complexity of Postoptimality Analysis of 0/1 Programs 

      Van Hoesel, Stan; Wagelmans, Albert (Massachusetts Institute of Technology, Operations Research Center, 1991-09)
      In this paper we address the complexity of postoptimality analysis of 0/1 programs with a linear objective function. After an optimal solution has been determined for a given cost vector, one may want to know how much each ...
    • An N Server Cutoff Priority Queue Where Customers Request a Random Number of Servers 

      Schaack, Christian; Larson, Richard C., 1943- (Massachusetts Institute of Technology, Operations Research Center, 1985-05)
      Consider a multi-priority, nonpreemptive, N-server Poisson arrival queueing system. The number of servers requested by an arrival has a known probability distribution. Service times are negative exponential. In order to ...