Browsing Library by Author "Corley, Herbert W."

Now showing items 1-7 of 7

    • Constraint Optimal Selection Techniques (COSTs) For A Class Of Linear Programming Problems 

      Sung, Tai-Kuan (Industrial & Manufacturing Engineering, 2007-09-17)
      This dissertation describes two classes of Constraint Optimal Selection Techniques (COSTs). An algorithm of each type is developed for solving nonnegative linear programming problems. In addition, geometric interpretations ...

    • Constraint Optimal Selection Techniques (COSTs) For Linear Programming 

      Saito, Goh (Industrial & Manufacturing Engineering, 2012-07-25)
      Simplex pivoting algorithms remain the dominant approach to solve linear programming (LP) because they have advantages over interior-point methods. However, current simplex algorithms are often inadequate for solving a ...

    • DYNAMIC CONSTRAINT OPTIMAL SELECTION TECHNIQUES FOR LINEAR PROGRAMMING 

      Noroziroshan, Alireza (2016-05-13)
      Linear programming has been studied for over 60 years. It has been considered as one of the most valuable optimization tool for many industrial problems. The simplex algorithm remains the predominant approach to solving ...

    • The Equivalence And Generalization Of Optimization Criteria 

      Charoensri, Surachai (Industrial & Manufacturing Engineering, 2011-10-11)
      In this dissertation we first show that existing optimization criteria are equivalent to the maximization of a real-valued function in a one-dimensional Euclidean space. The criteria are said to be scalar equivalent. All ...

    • New Equilibria For Noncooperative Games 

      Insuwan, Phantipa (Industrial & Manufacturing Engineering, 2008-08-08)
      In this dissertation we present an alternative to the Nash Equilibrium (NE), which is regarded as the fundamental solution concept in game theory. An NE provides a solution in which no player can improve his payoff by ...

    • Scalar Equilibria For N-person Games 

      Engsuwan, Narakorn (Industrial & Manufacturing Engineering, 2013-10-23)
      In this dissertation we develop a scalarization approach for one-shot, n-person games by defining the notion of Scalar Equilibria. We first show that existing solution concepts can be represented as Scalar Equlibria. For ...

    • Some New Results for Equilibria of N-Person Games 

      Nahhas, Ahmad; 0000-0002-5073-6572 (2017-11-28)
      In this dissertation, we present four journal articles in the area of game theory. In the first article, we define a generalized equilibrium for n−person normal form games. We prove that the Nash equilibrium and the mixed ...