AI & ChatGPT searches , social queriess for LINEAR PROGRAMMING
Search references for LINEAR PROGRAMMING. Phrases containing LINEAR PROGRAMMING
See searches and references containing LINEAR PROGRAMMING!
Search references for LINEAR PROGRAMMING. Phrases containing LINEAR PROGRAMMING
See searches and references containing LINEAR PROGRAMMING!LINEAR PROGRAMMING
Method to solve optimization problems
and objective are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization)
Linear_programming
Concept in integral mathematics
example, the linear programming relaxation has a value differing from that of the unrelaxed 0–1 integer program. The linear programming relaxation of
Linear_programming_relaxation
Mathematical optimization problem restricted to integers
integer linear programming (ILP), in which the objective function and the constraints (other than the integer constraints) are linear. Integer programming is
Integer_programming
Mathematical optimization concept
The dual of a given linear program (LP) is another LP that is derived from the original (the primal) LP in the following schematic way: Each variable in
Dual_linear_program
Concept in mathematical optimization
linear-fractional programming (LFP) is a generalization of linear programming (LP). Whereas the objective function in a linear program is a linear function
Linear-fractional_programming
Solution process for some optimization problems
minimization Linear programming nl (format) Nonlinear least squares List of optimization software Quadratically constrained quadratic programming Werner Fenchel
Nonlinear_programming
Solving an optimization problem with a quadratic objective function
function subject to linear constraints on the variables. Quadratic programming is a type of nonlinear programming. "Programming" in this context refers
Quadratic_programming
Approximation for nonlinear optimization
Successive Linear Programming (SLP), also known as Sequential Linear Programming, is an optimization technique for approximately solving nonlinear optimization
Successive_linear_programming
Software package
The GNU Linear Programming Kit (GLPK) is a software package intended for solving large-scale linear programming (LP), mixed integer programming (MIP),
GNU_Linear_Programming_Kit
"Linear genetic programming" is unrelated to "linear programming". Linear genetic programming (LGP) is a particular method of genetic programming wherein
Linear_genetic_programming
American mathematician (1914–2005)
algorithm, an algorithm for solving linear programming problems, and for his other work with linear programming. In statistics, Dantzig solved two open
George_Dantzig
Programming paradigm based on formal logic
Logic programming is a programming, database, and knowledge representation paradigm based on formal logic. A logic program is a set of sentences in logical
Logic_programming
Decoding method
theory and coding theory, linear programming decoding (LP decoding) is a decoding method which uses concepts from linear programming (LP) theory to solve decoding
Linear_programming_decoding
Subfield of mathematical optimization
transformations: Linear programming problems are the simplest convex programs. In LP, the objective and constraint functions are all linear. Quadratic programming are
Convex_optimization
Problem optimization method
logistics. This usage is the same as that in the phrases linear programming and mathematical programming, a synonym for mathematical optimization. The above
Dynamic_programming
Algorithm for linear programming
Dantzig's simplex algorithm (or simplex method) is an algorithm for linear programming. The name of the algorithm is derived from the concept of a simplex
Simplex_algorithm
Optimization technique for solving (mixed) integer linear programs
by solving a non-integer linear program, the linear relaxation of the given integer program. The theory of Linear Programming dictates that under mild
Cutting-plane_method
Framework for modeling optimization problems that involve uncertainty
stochastic programming methods have been developed: Scenario-based methods including sample average approximation Stochastic integer programming for problems
Stochastic_programming
Multi-objective linear programming is a subarea of mathematical optimization. A multiple objective linear program (MOLP) is a linear program with more than
Multi-objective linear programming
Multi-objective_linear_programming
Principle in mathematical optimization
primal and dual programs together is often easier than solving only one of them. Examples are linear programming and quadratic programming. A better and
Duality_(optimization)
Branch of numerical optimization
optimality. Linear programming optimization problems strictly fall under the category of deterministic global optimization. Much like linear programming problems
Deterministic global optimization
Deterministic_global_optimization
Algorithms for solving convex optimization problems
the mid-1980s. In 1984, Narendra Karmarkar developed a method for linear programming called Karmarkar's algorithm, which runs in polynomial time ( O (
Interior-point_method
Scheduled radio and television broadcasts
(such as linear television and linear channels). With the beginning of scheduled television in 1936, television programming was initially only concerned
Broadcast_programming
Sequential linear-quadratic programming (SLQP) is an iterative method for nonlinear optimization problems where objective function and constraints are
Sequential linear-quadratic programming
Sequential_linear-quadratic_programming
Study of mathematical algorithms for optimization problems
mathematical programming problem (a term not directly related to computer programming, but still in use for example in linear programming – see History
Mathematical_optimization
Linear map or polynomial function of degree one
ISBN 978-0-538-49790-9. Leonid N. Vaserstein (2006), "Linear Programming", in Leslie Hogben, ed., Handbook of Linear Algebra, Discrete Mathematics and Its Applications
Linear_function
The Hilbert basis of a convex cone C is a minimal set of integer vectors in C such that every integer vector in C is a conical combination of the vectors
Hilbert basis (linear programming)
Hilbert_basis_(linear_programming)
Initial set of valid possible values
non-negative. In pure integer programming problems, the feasible set is the set of integers (or some subset thereof). In linear programming problems, the feasible
Feasible_region
Extremes of a linear function over a convex polygonal region occur at the region's corners
optimization, the fundamental theorem of linear programming states, in a weak formulation, that the maxima and minima of a linear function over a convex polygonal
Fundamental theorem of linear programming
Fundamental_theorem_of_linear_programming
Soviet and American mathematician and computer scientist
scientist. He was most famous for his ellipsoid algorithm (1979) for linear programming, which was the first such algorithm known to have a polynomial running
Leonid_Khachiyan
Convex optimization problem
some market impact constraints, because they are not linear, cannot be solved by quadratic programming but can be formulated as SOCP problems. The standard
Second-order_cone_programming
NP-hard problem in combinatorial optimization
Graphs and Integer Programs", IBM Mathematical research Project (Princeton University) Dantzig, George B. (1963), Linear Programming and Extensions, Princeton
Travelling_salesman_problem
Subfield of convex optimization
Semidefinite programming (SDP) is a subfield of mathematical programming concerned with the optimization of a linear objective function (a user-specified
Semidefinite_programming
Optimization algorithm
in a diverse range of SQP methods. Sequential linear programming Sequential linear-quadratic programming Augmented Lagrangian method SQP methods have been
Sequential quadratic programming
Sequential_quadratic_programming
Several equations of degree 1 to be solved simultaneously
In mathematics, a system of linear equations (or linear system) is a collection of two or more linear equations involving the same variables. For example
System_of_linear_equations
In linear programming, a discipline within applied mathematics, a basic solution is any solution of a linear programming problem satisfying certain specified
Basic solution (linear programming)
Basic_solution_(linear_programming)
Machine learning and inference framework
use an integer linear programming (ILP) solver to solve the decision problem. Although theoretically solving an Integer Linear Program is exponential
Constrained_conditional_model
Suite of mathematical modeling and optimization tools
commercial optimization solver for linear programming (LP), mixed integer linear programming (MILP), convex quadratic programming (QP), convex quadratically constrained
FICO_Xpress
Hungarian and American mathematician and physicist (1903–1957)
"Reminiscences about the origins of linear programming.". In Bachem, A.; Grötschel, M.; Korte, B. (eds.). Mathematical Programming The State of the Art: Bonn 1982
John_von_Neumann
Optimizing objective functions that have constrained variables
of the hard constraints are linear and some hard constraints are inequalities, then the problem is a linear programming problem. This can be solved by
Constrained_optimization
Inequality which involves a linear function
In mathematics a linear inequality is an inequality which involves a linear function. A linear inequality contains one of the symbols of inequality: <
Linear_inequality
Statistical optimality criterion
Barrodale-Roberts algorithm) Because the problem is a linear program, any of the many linear programming techniques (including the simplex method as well as
Least_absolute_deviations
Graph coloring where graph elements are assigned sets of colors
the linear programming relaxation of traditional graph coloring. Indeed, fractional coloring problems are much more amenable to a linear programming approach
Fractional_coloring
Subfield of mathematical optimization
optimization. A considerable amount of it is unified by the theory of linear programming. Some examples of combinatorial optimization problems that are covered
Combinatorial_optimization
Branch of multiobjective optimization
linear programming, Wiley, New York SM Lee (1972) Goal programming for decision analysis, Auerback, Philadelphia JP Ignizio (1976) Goal programming and
Goal_programming
for solving linear programming problems with special structure Delayed column generation Integer linear programming: solve linear programming problems where
List_of_algorithms
Type of programming language
Scientific programming language may refer to two related, yet distinct, concepts in computer programming. In a broad sense, it describes any programming language
Scientific programming language
Scientific_programming_language
Class of algorithms that find approximate solutions to optimization problems
appropriate mathematical programming formulation (typically a convex programming) such as Linear programming, Semidefinite programming, etc, to obtain a relaxation
Approximation_algorithm
Optimization problem in mathematics
diagonal elements in the data matrices), second-order cone programming (SOCP) and linear programming (LP) relaxations providing the same objective value as
Quadratically constrained quadratic program
Quadratically_constrained_quadratic_program
Sphere that contains a set of objects
proposed a much simpler randomized algorithm, generalizing a randomized linear programming algorithm by Raimund Seidel. The expected running time of Welzl's
Bounding_sphere
Discipline concerning the application of advanced analytical methods
strategies Linear programming Nonlinear programming Integer programming in NP-complete problem specially for 0-1 integer linear programming for binary
Operations_research
Mathematical combinatorial optimization method
combinatorial optimization for solving integer linear programming (ILP) and mixed integer linear programming (MILP) problems with many variables. The method
Branch_and_price
Software for operations research
K. Ralphs: Noncommercial Software for Mixed-Integer Linear Programming. In: Integer Programming: Theory and Practice, John Karlof (ed.), CRC Press Operations
COIN-OR
Combinatorial optimization method
of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some or all the unknowns are
Branch_and_cut
Optimization by removing non-optimal solutions to subproblems
1016/0004-3702(84)90004-3. LiPS – Free easy-to-use GUI program intended for solving linear, integer and goal programming problems. Cbc – (Coin-or branch and cut) is
Branch_and_bound
constrained quadratic program Linear-fractional programming — objective is ratio of linear functions, constraints are linear Fractional programming — objective
List of numerical analysis topics
List_of_numerical_analysis_topics
Numerical optimization algorithm
Methods: Linear Algebra and Function Minimisation. Bristol: Adam Hilger. ISBN 978-0-85274-330-0. Avriel, Mordecai (2003). Nonlinear Programming: Analysis
Nelder–Mead_method
Optimization algorithm
feasible set is given by a set of linear constraints, then the subproblem to be solved in each iteration becomes a linear program. While the worst-case convergence
Frank–Wolfe_algorithm
Sequence of operations for a task
as into one of the following: Linear programming When searching for optimal solutions to a linear function bound by linear equality and inequality constraints
Algorithm
Method for solving certain optimization problems
least square errors. One of the advantages of IRLS over linear programming and convex programming is that it can be used with Gauss–Newton and Levenberg–Marquardt
Iteratively reweighted least squares
Iteratively_reweighted_least_squares
information about the original problem. For example, a linear programming relaxation of an integer programming problem removes the integrality constraint and
Relaxation_(approximation)
Algorithm used to solve non-linear least squares problems
also known as the damped least-squares (DLS) method, is used to solve non-linear least squares problems. These minimization problems arise especially in
Levenberg–Marquardt_algorithm
Rational design of new protein molecules
the search space, while other algorithms, such as A*, Monte Carlo, Linear Programming, or FASTER are used to search the remaining search space. The protein
Protein_design
Practical mathematics used in business
problems, more advanced mathematics - calculus, matrix algebra, and linear programming - may be applied. Business mathematics, sometimes called commercial
Business_mathematics
Mathematical algorithm for eliminating variables from a system of linear inequalities
Fourier–Motzkin elimination and complexity estimates are given in. Linear programming is well known to give solutions to inequality systems in polynomial
Fourier–Motzkin_elimination
Situation where total gains match total losses
often solved with the minimax theorem which is closely related to linear programming duality, or with Nash equilibrium. In contrast, positive-sum or win–win
Zero-sum_game
Optimization method
ISBN 978-0-471-91547-8 Luenberger, David G.; Ye, Yinyu (2008), Linear and nonlinear programming, International Series in Operations Research & Management Science
Broyden–Fletcher–Goldfarb–Shanno algorithm
Broyden–Fletcher–Goldfarb–Shanno_algorithm
Indian mathematician (born 1956)
for linear programming, which is generally referred to as an interior point method. The algorithm is a cornerstone in the field of linear programming. He
Narendra_Karmarkar
Operations related to the reuse of products and materials
reverse logistics network are the Mixed Integer Linear Programming (MILP) and Mixed Integer Non-Linear Programming (MINLP) methods, where the objective function
Reverse logistics network modelling
Reverse_logistics_network_modelling
Mathematical concept
programming Decision-making software Goal programming Interactive Decision Maps Multiple-criteria decision-making Multi-objective linear programming Multi-disciplinary
Multi-objective_optimization
Sequence of locally optimal choices
of a dynamic programming algorithm. Uriel Feige notes that: [Greedy algorithms] may be viewed as the ultimate form of dynamic programming, in which only
Greedy_algorithm
Type of multi-objective optimization
{\displaystyle b} . Isermann extended the theory of linear programming duality to lexicographic linear programs, and developed a lexicographic simplex algorithm
Lexicographic_optimization
Optimization algorithm
vectors that represent the approximation implicitly. Due to its resulting linear memory requirement, the L-BFGS method is particularly well suited for optimization
Limited-memory_BFGS
Optimization problem
considered to be some of the earliest work in linear programming. The Stigler diet question is a linear programming problem. Lacking any sophisticated method
Stigler_diet
Mathematical problem in operations research
the knapsack problem. The problem can be formulated as an integer linear programming problem. A paper machine can produce an unlimited number of master
Cutting_stock_problem
Optimization solver
used for linear programming (LP), quadratic programming (QP), quadratically constrained programming (QCP), mixed integer linear programming (MILP), mixed-integer
Gurobi_Optimizer
Properties of mathematical relationships
Linear actuator Linear element Linear foot Linear system Linear programming Linear differential equation Bilinear Multilinear Linear motor Linear interpolation
Linearity
Equivalence of optimization problems
duality theorem in linear programming, which states that if the primal program has an optimal solution, x*, then the dual program also has an optimal
Max-flow_min-cut_theorem
Class of algorithms for solving constrained optimization problems
[citation needed] Sequential quadratic programming Sequential linear programming Sequential linear-quadratic programming Open source and non-free/commercial
Augmented_Lagrangian_method
Computer compiler optimization technique
offline stage, an optimal spill set is first gathered using Integer Linear Programming. Then, live ranges are annotated using the compressAnnotation algorithm
Register_allocation
Mathematical model for sequential decision making under uncertainty
{\displaystyle {\bar {V}}^{*}} , we could use the following linear programming model: Primal linear program(P-LP) Minimize g s.t g − ∑ j ∈ S q ( j ∣ i , a ) h
Markov_decision_process
Algebraic modeling language
among them: Linear programming Quadratic programming Nonlinear programming Mixed-integer programming Mixed-integer quadratic programming with or without
AMPL
Study of optimal transportation and allocation of resources
sometimes known as the Monge–Kantorovich transportation problem. The linear programming formulation of the transportation problem is also known as the Hitchcock–Koopmans
Transportation theory (mathematics)
Transportation_theory_(mathematics)
Branch of mathematics
Geometric algebra Linear programming Linear regression, a statistical estimation method Numerical linear algebra Outline of linear algebra Transformation
Linear_algebra
Distance function defined between probability distributions
Jiří; Gärtner, Bernd (2007), "Duality of Linear Programming", Understanding and Using Linear Programming, Universitext, Berlin, Heidelberg: Springer
Wasserstein_metric
Primal-Dual algorithm optimization for convex problems
algorithm in PyTorch for GPU-accelerated linear programming in his Primal-Dual Algorithm for Linear Programming GitHub Repository The Manopt.jl package
Chambolle–Pock_algorithm
LINDO – (Linear, Interactive, and Discrete optimizer) a software package for linear programming, integer programming, nonlinear programming, stochastic
List_of_optimization_software
Operations research and management sciences award
since 1975. The first recipient was George B. Dantzig for his work on linear programming. 2025 Renato Monteiro 2024 Jim Dai 2023 Christos Papadimitriou and
John_von_Neumann_Theory_Prize
Combinatorial optimization problem
the minimum cost flow problem, which in turn is a special case of a linear program. While it is possible to solve any of these problems using the simplex
Assignment_problem
Quadratic programming as a special case
theory, the linear complementarity problem (LCP) arises frequently in computational mechanics and encompasses the well-known quadratic programming as a special
Linear complementarity problem
Linear_complementarity_problem
algorithm Sequential Quadratic Programming (SQP) algorithm Knitro provides tools for solving optimization models (both linear and nonlinear) with binary or
Artelys_Knitro
Type of algorithm for constrained optimization
Other nonlinear programming algorithms: Sequential quadratic programming Successive linear programming Sequential linear-quadratic programming Interior point
Penalty_method
Russian mathematician (1912–1986)
optimal allocation of resources. He is regarded as the founder of linear programming. He was the winner of the Stalin Prize in 1949 and the Nobel Memorial
Leonid_Kantorovich
System of resource-aware logic
ideas from linear logic have been influential in fields such as programming languages, game semantics, and quantum physics (because linear logic can be
Linear_logic
Method of solving linear programming problems
In operations research, the Big M method is a method of solving linear programming problems using the simplex algorithm. The Big M method extends the simplex
Big_M_method
Program for solving the travelling salesman problem
routing problem the company had posed in 1996. Concorde requires a linear programming solver and only supports QSopt and CPLEX 8.0. Hitte et al. (2003)
Concorde_TSP_Solver
American computer scientist
effects and compositing. He co-authored a polynomial-time algorithm for linear programming with Leonid A. Levin. Yamnitsky emigrated from the former Soviet Union
Boris_Yamnitsky
Type of programming language
Lucas; Shirley Moody; Bjarni Kristjansson (1995). "Sets and indices in linear programming modelling and their integration with relational data models". Computational
Algebraic_modeling_language
Mathematical algorithm
competitive to other methods when applied to such problems as training linear support vector machines (see LIBLINEAR) and non-negative matrix factorization
Coordinate_descent
American computer scientist
Vanderbei is the author of a textbook on linear programming and a software package for nonlinear programming called LOQO. Vanderbei received widespread
Robert_J._Vanderbei
LINEAR PROGRAMMING
LINEAR PROGRAMMING
Boy/Male
Sikh
Love unending
Surname or Lastname
English
English : variant of Lanier 1.Dutch : variant of Leonard.Jewish (western Ashkenazic) : name taken by someone who was good at chanting the Pentateuch at public worship in the synagogue or who regularly did so, from West Yiddish layner ‘reader’ (a derivative of West Yiddish laynen ‘to read’, which comes ultimately from Latin legere ‘to read’).Jewish (Ashkenazic) : occupational name for a flax grower or merchant, from German Lein ‘flax’ + agent suffix -er.
Surname or Lastname
English (Cornish)
English (Cornish) : habitational name from a place named with Cornish lan ‘church’. In England this surname is now found chiefly in the southern counties of Wiltshire and Hampshire, and Berkshire; it has no doubt moved there from Cornwall.
Surname or Lastname
English
English : metronymic from Line.
Boy/Male
Hindu
The Sun
Girl/Female
Irish
Eimear possessed the “Six Gifts of Womanhood†– “beauty, a gentle voice, sweet words, wisdom, needlework and chastity!†She was bethrothed to the warrior Cuchulainn (read the legend) when they were children and they loved each other very deeply. But Cuchulainn had “a wandering eye†and Eimear endured this, realizing “everything new is fair,†but when he made love to Fand, wife of the sea god Manannan, Eimear confronted the lovers. After seeing the strength of Fand’s love she offered to withdraw. Touched by this display of unselfishness, Fand left Cuchulainn and returned to the sea. When Cuchulainn died Eimear spoke movingly and lovingly at his graveside.
Female
English
English name probably derived from Germanic lindi, LINDA means "serpent."Â In some cases, it may have been derived from the Spanish word for "pretty."
Female
Scottish
Variant spelling of Scottish Lilias, LILEAS means "lily."
Surname or Lastname
English (Devon; of Cornish origin)
English (Devon; of Cornish origin) : topographic name for someone who lived by a menhir, i.e. a tall standing stone erected in prehistoric times (Cornish men ‘stone’ + hir ‘long’).
Surname or Lastname
Swedish
Swedish : ornamental name from lind ‘lime tree’ + either the German suffix -er denoting an inhabitant, or the surname suffix -ér, derived from the Latin adjectival ending -er(i)us.English (mainly southeastern) : variant of Lind 2.German : habitational name from any of numerous places called Linden or Lindern, named with German Linden ‘lime trees’.
Boy/Male
Irish
Meaning “â€fair-haired,â€â€ the name has been popular since the sixth century when St. Finbar came to an area of Cork that was being tormented by a serpent. The people begged him to do something to help them. One night he went to where the serpent was sleeping and sprinkled it with holy water. The angry serpent tore and devoured the land until she slithered into the sea at Cork Harbor. The track she left behind filled with water and became the River Lee and that’s why St. Finbar is the patron saint of Cork. It is said that the sun didn’t set for two weeks after Finbar’s death.
Male
English
Irish Anglicized form of Gaelic Fionnbarr, FINBAR means "fair-headed."
Female
English
Variant spelling of English Linsey, LINSAY means "Lincoln's wetlands."
Surname or Lastname
English
English : habitational name from Lingart, Lancashire, or Lingards Wood in Marsden, West Yorkshire, both named from Old English līn ‘flax’ + garðr ‘enclosure’.
Male
Scandinavian
Scandinavian form of Old Norse Einarr, EINAR means "lone warrior."
Surname or Lastname
English
English : occupational name for a whitewasher, Middle English limer, lymer, an agent derivative of Old English līm ‘lime’.
Male
Greek
(ΑἰνÎας) Variant spelling of Greek AineÃas, AINEAS means "praiseworthy."
Boy/Male
Hindu
Lingam
Male
Yiddish
 Variant spelling of Yiddish Lieber, LIBER means "beloved." Compare with another form of Liber.
Surname or Lastname
English
English : variant of Lingard.French : occupational name for a maker of or dealer in linen goods, from Old French linge ‘linen (goods)’ (see Linge 1).
LINEAR PROGRAMMING
LINEAR PROGRAMMING
Boy/Male
Indian
Honor
Boy/Male
Hindu, Indian, Malayalam, Marathi, Traditional
One who Attracts the World; Jagatmohan
Boy/Male
Indian, Sanskrit
Reward
Girl/Female
Indian
Focused, Once who knows direction
Girl/Female
Tamil
Neelabja | நீலாபà¯à®œà®¾
Blue lotus
Boy/Male
Arabic, Muslim, Sindhi
Delicate; Good
Boy/Male
Indian
Flower
Girl/Female
Italian Irish Latin
Lady. From the respectful title Donna.
Girl/Female
British, English, Polish, Swedish
Flowering; From Florence; Blossoming; Charming
Girl/Female
Tamil
Ujwala | உஜà¯à®œà®µà®¾à®²à®¾
Bright, Lustrous
LINEAR PROGRAMMING
LINEAR PROGRAMMING
LINEAR PROGRAMMING
LINEAR PROGRAMMING
LINEAR PROGRAMMING
n.
A vessel belonging to a regular line of packets; also, a line-of-battle ship; a ship of the line.
a.
Like a line; narrow; of the same breadth throughout, except at the extremities; as, a linear leaf.
n.
One who adjusts things to a line or lines or brings them into line.
a.
Formed by right lines; rectilineal; as, a right-lined angle.
a.
Of a linear shape.
n.
Made of linen; as, linen cloth; a linen stocking.
n.
A lunar distance.
v. t.
To mark with a line or lines; to cover with lines; as, to line a copy book.
v. t.
To convert into vinegar; to make like vinegar; to render sour or sharp.
a.
Linear.
a.
In the direction of a line; of or pertaining to a line; measured on, or ascertained by, a line; linear; as, lineal magnitude.
n.
One who lines, as, a liner of shoes.
a.
Of, pertaining to, or included by, two lines; as, bilinear coordinates.
a.
Of or pertaining to a line; consisting of lines; in a straight direction; lineal.
a.
Composed of lines; delineated; as, lineal designs.
adv.
In a linear manner; with lines.
n.
Alt. of Lingam
prep. & adv.
Near.
a.
Descending in a direct line from an ancestor; hereditary; derived from ancestors; -- opposed to collateral; as, a lineal descent or a lineal descendant.
n.
A dealer in linen; a linen draper.