scispace - formally typeset
Search or ask a question
Topic

Concave function

About: Concave function is a research topic. Over the lifetime, 1415 publications have been published within this topic receiving 33278 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: This paper analyzes mathematically a queueing model where a single server dispenses service to several, m, non-preemptive priority classes and finds an implicit function as well as upper and lower bounds on the expected waiting time of k customer.
Abstract: This paper analyzes mathematically a queueing model where a single server dispenses service to several, m, non-preemptive priority classes. It is assumed that the arrival process of customers who belong to the k class (k customers) is Poisson, and their service times are independent, identical, arbitrarily distributed random variables. The priority degree of a customer at a certain moment is not only a function of his class, but is also a general concave function of the time he has already spent in the system. (The discipline is termed “dynamic-priority.”) Upon departure the server selects for service, from the customers present, the one with the highest instantaneous priority degree, breaking ties by the FIFO rule. An implicit function as well as upper and lower bounds on the expected waiting time of k customer are found. The effectiveness of the bounds is demonstrated by a numerical example.

40 citations

Journal ArticleDOI
TL;DR: Many structured large scale linear programming problems can be transformed into an equivalent problem of maximizing a piecewise linear, concave function subject to linear constraints, yielding refinements of existing algorithms.
Abstract: Many structured large scale linear programming problems can be transformed into an equivalent problem of maximizing a piecewise linear, concave function subject to linear constraints. The concave problem can be solved in a finite number of steps using a steepest ascent algorithm. This principle is applied to block diagonal systems yielding refinements of existing algorithms. An application to the multistage problem yields an entirely new algorithm.

39 citations

Journal ArticleDOI
TL;DR: Test results show that the e-dominance criterion can often significantly reduce the number of nondominated path vectors, compared to the standard dominance criterion, and there is a consequent reduction in both computation time and storage requirements.

39 citations

Book
01 May 1986
TL;DR: This book discusses Simplex Procedure, Subspaces, Matrices, Affine Sets, Cones, Convex Sets, and the Linear Programming Problem.
Abstract: 1. An Introduction to Mathematical Programming 2. Subspaces, Matrices, Affine Sets, Cones, Convex Sets, and the Linear Programming Problem 3. The Primal Simplex Procedure 4. Duality and the Linear Complementarity Problem 5. Other Simplex Procedures 6. Network Programming 7. Convex and Concave Functions 8. Optimality Conditions 9. Search Techniques for Unconstrained Optimization Problems 10. Penalty Function Methods

39 citations

Journal ArticleDOI
TL;DR: In this article, the Fekete-Szego problem with real parameter λ for the class Co (α ) of concave univalent functions was considered, where λ is the real parameter.

39 citations


Network Information
Related Topics (5)
Markov chain
51.9K papers, 1.3M citations
74% related
Bounded function
77.2K papers, 1.3M citations
74% related
Polynomial
52.6K papers, 853.1K citations
72% related
Upper and lower bounds
56.9K papers, 1.1M citations
72% related
Eigenvalues and eigenvectors
51.7K papers, 1.1M citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202316
202240
202158
202049
201952
201860