A decomposition principle for a generalized linear and piece-wise linear program

1977 ◽  
Vol 28 (1) ◽  
pp. 85-92 ◽  
Author(s):  
S. S. Chadha ◽  
J. M. Gupta
Keyword(s):  
Linear Program ◽  
Decomposition Principle

Large qualitative models of complex chemical and bioengineering processes

1991 ◽  
Vol 56 (10) ◽  
pp. 2107-2141 ◽  
Author(s):  
Mirko Dohnal
Keyword(s):  
Case Studies ◽  
Chemical Process ◽  
Ad Hoc ◽  
Chemical Reactor ◽  
Theoretical Background ◽  
Qualitative Model ◽  
Complex Chemical ◽  
Practical Applications ◽  
Qualitative Models ◽  
Decomposition Principle

Qualitative model is a theoretical background of commonsense. Complex qualitative models can have prohibitively many solutions (qualitative states). Therefore a qualitative analogy of such classical quantitative tools as e.g. the decomposition is developed. Practical applications of decomposition principle is nearly always ad hoc. Therefore two case studies are presented in details, a chemical process (mixer, chemical reactor, separator) and an anaerobic fermentor.

Extended XOR-based visual cryptography schemes by integer linear program

2021 ◽  
Vol 186 ◽  
pp. 108122
Author(s):  
Xiaotian Wu ◽  
Peng Yao ◽  
Na An
Keyword(s):  
Visual Cryptography ◽  
Linear Program ◽  
Integer Linear Program

scholarly journals Discrete-Time Constrained Average Stochastic Games with Independent State Processes

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1089
Author(s):  
Wenzhao Zhang
Keyword(s):  
Discrete Time ◽  
Stochastic Games ◽  
Transition Probability ◽  
Existence Condition ◽  
Linear Program ◽  
Global Minimizer ◽  
Independent State ◽  
Occupation Measures ◽  
Best Response ◽  
Mathematic Program

In this paper, we consider the discrete-time constrained average stochastic games with independent state processes. The state space of each player is denumerable and one-stage cost functions can be unbounded. In these game models, each player chooses an action each time which influences the transition probability of a Markov chain controlled only by this player. Moreover, each player needs to pay some costs which depend on the actions of all the players. First, we give an existence condition of stationary constrained Nash equilibria based on the technique of average occupation measures and the best response linear program. Then, combining the best response linear program and duality program, we present a non-convex mathematic program and prove that each stationary Nash equilibrium is a global minimizer of this mathematic program. Finally, a controlled wireless network is presented to illustrate our main results.

scholarly journals Analysis of student error in solving story problems in linear program materials

2021 ◽  
Vol 1968 (1) ◽  
pp. 012022
Author(s):  
F F Kaeng ◽  
J U L Mangobi ◽  
V E Regar
Keyword(s):  
Linear Program ◽  
Story Problems ◽  
Student Error
Sign in / Sign up

Export Citation Format

Share Document