programs 
Based on the properties of the generalized geometric programming, the dual programs of these two problems are derived.


Furthermore, the duality theorems and related KuhnTucker conditions for two pairs of the primedual programs are also established by the duality theory.


An inexact lagrangenewton method for stochastic quadratic programs with recourse


In the semiarid area of the Loess Plateau, Caragana korshinski, a leguminous shrub, is the dominant plant species widely used in vegetation rehabilitation programs.


In the semiarid Horqin sandy land of north China, Caragana microphylla, a leguminous shrub, is the dominant plant species and is widely used in vegetation reestablishment programs to stabilize shifting sand.


It is necessary to consider such limit behaviors when we consider the properties of infinite objects in computer science, such as infinite logic programs, the symbolic solutions of infinite polynomial equations.


One is to seek more expressive logics or type systems to specify or reason about the properties of lowlevel or highlevel programs.


The other is to study the technology of certifying compilation in which the compiler generates proofs for programs with annotations.


NΣlabeled calculus is a generalization of Nlabeled calculus so as to describe timeconcerned recognition, knowledge, belief and decision of humans or computer programs together with related external physical or logical phenomena.


The aim of this paper is to extend the probabilistic choice in probabilistic programs to subprobabilistic choice, i.e., of the form (p)P?(q)Q where p + q ? 1.


One of these interprets programs as subprobabilistic distributions on state spaces via denotational semantics.


The other interprets programs as bounded expectation transformers via wpsemantics.


This paper proposes an axiomatic systems for total logic, and proves its soundness and completeness in a classical pattern on the structure of programs.


Algorithmization and programming principles for logic control and "reactive" systems are formulated, regarding algorithms and programs as finite automata.


A Fast Consequence Recognition Algorithm for Monadic Logical Programs


Optimal programs and feedback controls are derived from sufficient conditions of optimality.


A method is put forward for the generation of optimal strategiesa set of the versions of the fulfillment of programs on the basis of a vector criterion.


Financial and Economic Analysis and Efficiency Evaluation of Investment Projects and Programs.


The publications on financial and economic analysis and efficiency evaluation of investment projects and programs were reviewed, and the current state of research was analyzed.


Financial and Economic Analysis and Efficiency Evaluation of Investment Projects and Programs.

