摘要:

An approach for solving discrete optimization problems by decomposition is illustrated by a linear integer program and two integer problems. Numerical results are given for the inventory problems.

ISSN:0323-3898    

DOI:10.1080/02331937708842401

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

A Largrangian function approach to duality for a complex nonlinear fractional programming problem over cones is presented and under certain convexity type assumptions a saddle point theorem, with other duality results, is proved.

ISSN:0323-3898    

DOI:10.1080/02331937708842402

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

Some general criteria are given for the stability of a system of convex inequalities and then extended to an arbitrary system by the procedure of convex approximation. The stability is understood in the following sense: given a systemxεDG(x)εM, whereDis a subset of a locally convex spaceX, Ma closed convex cone in a locally convex spaceY, Ga mapping fromDtoY, a solution[xbar]is said to be stable if for every neighbourhoodWofxbar;there exists a neighbourhoodVof 0 εYsuch that for any conditinuous mappingA:D→YsatisfyingA(D∩W) ⊂V+Mthe perturbed systemxεDG(x)A(x)εMhas at lease one solution inW; the system is said to be stable if every its solution is stable.

ISSN:0323-3898    

DOI:10.1080/02331937708842403

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

Several authors generalized the conjugation in the sense of Fenchel so that it is not realized with respect to the (component-wise) continuous bilinear form (x, y) overX×Y(a – dual – topological pair), but that this is replaced by an arbitrary coupling functional ϕ ∈ RX×Y. Properties of such functionalsjhave been studied, which, by means of a twofold conjugation with respect to ϕ, are transformed into themselves. The aim of this paper is to give a set-theoretic description by means of the epigraph of these functionals, which proves to be equivalent to the analytical one.

ISSN:0323-3898    

DOI:10.1080/02331937708842404

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

If a partial ordering or preordering induced by a coneDdefines a multi objective optimization problem, then scalarizing functionals for this problem shall posses two basic properties.D– monotonicity andDeapproximation. Several ways of constructing functionals with these properties are discussed in the paper.

ISSN:0323-3898    

DOI:10.1080/02331937708842405

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

Mathematical programming formulation of the convex lexicographic multi-criteria problems typically lacks a constraint qualification. Therefore the classical Kuhn-tucker theory fails to characterize their optimal solutions. Furthermore, numerical methods for solving the lexicographic problems are virtually nonexistent. This paper shows that using a recent theory of convex programming, which is free of a constraint qualification assumption, it is possible both to characterize and to calculate the optimal solutions of the convex lexicographic problem.

ISSN:0323-3898    

DOI:10.1080/02331937708842406

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

There exists at least one pure strategy for each player of zero-sum two-person matrix-game which, if used against anyone of his opponent's optimal mixed strategic, yields the value of the game. This assertion will be extend to games where the payoff function is quasi concave quasi convex and upper/lower semi continuous. The result will be applied to games where one of the two players takes maximum advantage of the mistakes, if any, of his opponent. It will be shown that this problem is equivalence to a problem of Lexicographic multi objective Programming.

ISSN:0323-3898    

DOI:10.1080/02331937708842407

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

The problem of optimal standardization in industry is the. choice of optimal parameters concerning elements to be produced. In this paper we consider tile problem as a problem of discrete optimization and present a classification. We specially inquire the structure of permissible points and find on this base effective search algorithms for construction of solutions. Further more we demonstrate the application of those algorithms for a wide class of problems of optimization as there are for example the problem of charge distribution the problem of stand distribution of production, the choice of a stock of machine, them-traveling salesman problem.

ISSN:0323-3898    

DOI:10.1080/02331937708842408

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

This paper investigates theN-Warehouse-Problem under the condition of linear cost-functions and constant profit made from transport (per unit stored) from warehouse i to warehousej, i≠j. Applying this model we obtain and approximation for the optimal decision in a model where transportation profit does not remain constant. A new expression for the expected costs in introduced, which facilitates the comparison of the costs with those ofNindependent warehouse. In the appendix several problems are solved.

ISSN:0323-3898    

DOI:10.1080/02331937708842409

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor

摘要:

This paper considers a limited queue space, single channel, first come first served heterogeneous queueing system. There are two operating states sayEandF. For either state, the time in transition from one state to the other, follows an exponential distribution. In both the statesEandF, the arrivals are Poissonian with different parameters and the service times have different exponential distributions. In either state, an additional numberMof units join the system whenever the number already there declines to one unit. Thus the channel is busy at all times.

ISSN:0323-3898    

DOI:10.1080/02331937708842410

出版商:Akademic-Verlag    

年代:1977

数据来源: Taylor